On recognizable sets of integers
From MaRDI portal
Publication:1273179
DOI10.5802/jtnb.219zbMath1046.11500OpenAlexW2963045707MaRDI QIDQ1273179
Publication date: 23 June 1999
Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=JTNB_1998__10_1_65_0
Related Items
Asymptotic properties of free monoid morphisms, Dynamical directions in numeration, Syndeticity and independent substitutions, An asymptotic version of Cobham’s theorem, Conjugacy of unimodular Pisot substitution subshifts to domain exchanges, Cobham-Semenov theorem and \(\mathbb N^d\)-subshifts, Self-similar tiling systems, topological factors and stretching factors
Cites Work
- Unnamed Item
- Substitutions and \(\beta\) systems of numeration
- On the Cobham-Semenov theorem
- How to write integers in a non-integral basis
- Substitution dynamical systems - spectral analysis
- A generalization of automatic sequences
- Power of words and recognizability of fixpoints of a substitution
- Presburgerness of predicates regular in two number systems
- Independent numeration systems and syndeticity
- Logic and \(p\)-recognizable sets of integers
- A characterization of substitutive sequences using return words
- A generalization of Cobham's theorem
- Bertrand numeration systems and recognizability
- On the factors of automatic words
- Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems
- Complexité des facteurs des mots infinis engendrés par morphismes itérés
- On theβ-expansions of real numbers
- Développement en base $\theta$, répartition modulo un de la suite $(x\theta \sp n)$, n$\ge 0$, langages codés et $\theta$-shift
- Substitutional dynamical systems, Bratteli diagrams and dimension groups
- Suites algébriques, automates et substitutions
- Une généralisation du théorème de Cobham
- An Introduction to Symbolic Dynamics and Coding
- An extension of the Cobham-Semënov Theorem
- Recognizable sets of numbers in nonstandard bases
- On the base-dependence of sets of numbers recognizable by finite automata
- Uniform tag sequences
