Bertrand numeration systems and recognizability
From MaRDI portal
Publication:1391295
DOI10.1016/S0304-3975(96)00260-5zbMath0957.11015MaRDI QIDQ1391295
Véronique Bruyère, Georges Hansel
Publication date: 22 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
characteristic polynomial; finite automaton; Pisot number; linear numeration system; recognizable sets of numbers
Related Items
On multiplicatively dependent linear numeration systems, and periodic points, An extension of the Cobham-Semënov Theorem, Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series, Real numbers having ultimately periodic representations in abstract numeration systems, Automatic maps in exotic numeration systems, Extensions and restrictions of Wythoff's game preserving its \(\mathcal P\) positions, Self-similar tiling systems, topological factors and stretching factors, On recognizable sets of integers, Independent numeration systems and syndeticity, Generalization of automatic sequences for numeration systems on a regular language, Decidability questions related to abstract numeration systems, Syndeticity and independent substitutions, Abstract \(\beta\)-expansions and ultimately periodic representations, A Hierarchy of Automaticω-Words having a Decidable MSO Theory, A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the Cobham-Semenov theorem
- Automatic maps in exotic numeration systems
- How to write integers in a non-integral basis
- The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable
- Logic and \(p\)-recognizable sets of integers
- \(\beta\)-shift, numeration systems, and automata
- On theβ-expansions of real numbers
- Weak Second‐Order Arithmetic and Finite Automata
- Systems of Numeration
- 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
- Suites algébriques, automates et substitutions
- Representations of numbers and finite automata
- An extension of the Cobham-Semënov Theorem
- Recognizable sets of numbers in nonstandard bases
- Numeration systems, linear recurrences, and regular sets
- On the base-dependence of sets of numbers recognizable by finite automata
- Uniform tag sequences
