On the base-dependence of sets of numbers recognizable by finite automata
From MaRDI portal
Publication:5569462
DOI10.1007/BF01746527zbMath0179.02501WikidataQ29028187 ScholiaQ29028187MaRDI QIDQ5569462
Publication date: 1969
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Related Items
Ultimate periodicity problem for linear numeration systems, Unnamed Item, Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials, A Fibonacci type sequence with Prouhet–Thue–Morse coefficients, Recognizable sets of numbers in nonstandard bases, Joining k- and l-recognizable sets of natural numbers, Quantitative estimates for the size of an intersection of sparse automatic sets, On interpretations of Presburger arithmetic in Büchi arithmetics, Addition machines, automatic functions and open problems of Floyd and Knuth, Spectra and satisfiability for logics with successor and a unary function, Rudin-Shapiro Sums via Automata Theory and Logic, On \(k\)-regularity of sequences of valuations and last non-zero digits, An asymptotic version of Cobham’s theorem, Uniform tag sequences, Unnamed Item, From Combinatorial Games to Shape-Symmetric Morphisms, Unnamed Item, A multi-dimensional analogue of Cobham’s theorem for fractals, A list of arithmetical structures complete with respect to the first-order definability, A Generalization of Semenov’s Theorem to Automata over Real Numbers, Unnamed Item, Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series, Unnamed Item, Automatic Sequences and Generalised Polynomials, SELF-SIMILAR STRUCTURE OF RESCALED EVOLUTION SETS OF CELLULAR AUTOMATA II, Unnamed Item, A More Reasonable Proof of Cobham’s Theorem, How to prove that a sequence is not automatic, Star-free sets of integers, Asymptotic properties of free monoid morphisms, Hartmanis-Stearns Conjecture on Real Time and Transcendence, Hyperquadratic continued fractions and automatic sequences, Automata and finite order elements in the Nottingham group, On iterating linear transformations over recognizable sets of integers, Dynamical directions in numeration, Arithmetics properties of substitutions and infinite automata, On multiplicatively dependent linear numeration systems, and periodic points, European Summer Meeting of the Association for Symbolic Logic, Syndeticity and independent substitutions, On the context-freeness of the set of words containing overlaps, LOGICAL CHARACTERIZATION OF RECOGNIZABLE SETS OF POLYNOMIALS OVER A FINITE FIELD, Multi-dimensional sets recognizable in all abstract numeration systems, On the Recognizability of Self-generating Sets, Hybrid quasicrystals, transport and localization in products of minimal sets, Papers presented at the conference `XXIIIrd Journées Arithmétiques', Graz, Austria, July 6--12, 2003, Automata and algebraicity, Uniform tag systems for paperfolding sequences, THE MINIMAL GROWTH OF A -REGULAR SEQUENCE, Linear cellular automata, finite automata and Pascal's triangle, Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems, The growth ratio of synchronous rational relations is unique, On Multiplicative Independent Bases for Canonical Number Systems in Cyclotomic Number Fields, Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n)), Some explicit continued fraction expansions, Sur la transcendance de la série formelle Π, Automaticity of double sequences generated by one-dimensional linear cellular automata, Automatic Sets of Rational Numbers, Thue, combinatorics on words, and conjectures inspired by the Thue-Morse sequence, Bertrand numeration systems and recognizability, On the factors of automatic words, Path sets in one-sided symbolic dynamics, Mots sans carre et morphismes iterés, The definable criterion for definability in Presburger arithmetic and its applications., Semiautomatic structures, Is the full susceptibility of the square-lattice Ising model a differentially algebraic function?, Properties and limits of recognition of sets of integers by countable automata, Automata methods in transcendence, Unnamed Item, On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases, Sur le développement en fraction continue de la série de Baum et Sweet, Number Theoretic Aspects of Regular Sequences, First-Order Logic and Numeration Systems, The ring of \(k\)-regular sequences. II., Counting the solutions of Presburger equations without enumerating them., Büchi Automata Recognizing Sets of Reals Definable in First-Order Logic with Addition and Order, Ostrowski-automatic sequences: theory and applications, A short proof of a theorem of Cobham on substitutions, Cobham's Theorem seen through Büchi's Theorem, On vanishing coefficients of algebraic power series over fields of positive characteristic, On automatic subsets of the Gaussian integers, Syntactical and automatic properties of sets of polynomials over finite fields, Automatic maps in exotic numeration systems, Unnamed Item, The ring of \(k\)-regular sequences, On certain recurrent and automatic sequences in finite fields, Cobham-Semenov theorem and \(\mathbb N^d\)-subshifts, Function fields in positive characteristic: expansions and Cobham's theorem, Undecidable extensions of Büchi arithmetic and Cobham-Semënov Theorem, An analogue of Cobham’s theorem for fractals, The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable, Sur quelques classes d’applications de $N^2$ dans les ensembles finis, It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base, Robustness of Pisot-regular sequences, A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems, Cobham’s theorem and its extensions, The Critical Exponent is Computable for Automatic Sequences, Mock characters and the Kronecker symbol, Finite transducers for divisibility monoids, The signature of rational languages, An extension of the Cobham-Semënov Theorem, Subword complexity and non-automaticity of certain completely multiplicative functions, Minimal automaton for multiplying and translating the Thue-Morse set, Self-similar tiling systems, topological factors and stretching factors, Transcendence of power series for some number theoretic functions, Presburgerness of predicates regular in two number systems, Defining Multiplication in Some Additive Expansions of Polynomial Rings, A generalization of Cobham's theorem to automata over real numbers, On number systems with finite degree of ambiguity, On recognizable sets of integers, A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS, Independent numeration systems and syndeticity, Substitutive systems and a finitary version of Cobham's theorem, Regular sequences and synchronized sequences in abstract numeration systems, Tree adjunct languages as integer set recognizers†, Multiplicative automatic sequences, Life and Mathematics of Alfred Jacobus van der Poorten (1942–2010), Transcendence of formal power series with rational coefficients, Consistent systems of linear differential and difference equations, Suites algébriques, automates et substitutions, Sum of digits and change of base, A method of Mahler in transcendence theory and some of its applications, Support of an algebraic series as the range of a recursive sequence, The entropy and Hausdorff dimension of self-similar sets, Bases and ambiguity of number systems, 2- and 3-Mahler recurrences, An analogue of Cobham's theorem for graph directed iterated function systems, Invertible substitutions and local isomorphisms
Cites Work
