Bertrand numeration systems and recognizability
From MaRDI portal
Publication:1391295
DOI10.1016/S0304-3975(96)00260-5zbMath0957.11015MaRDI QIDQ1391295
Georges Hansel, Véronique Bruyère
Publication date: 22 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
characteristic polynomialfinite automatonPisot numberlinear numeration systemrecognizable sets of numbers
Related Items (35)
Decidability questions related to abstract numeration systems ⋮ Mechanical Proofs of Properties of the Tribonacci Word ⋮ On multiplicatively dependent linear numeration systems, and periodic points ⋮ Syndeticity and independent substitutions ⋮ Decision algorithms for Fibonacci-automatic Words, I: Basic results ⋮ Abstract \(\beta\)-expansions and ultimately periodic representations ⋮ Ultimate periodicity problem for linear numeration systems ⋮ A full characterization of Bertrand numeration systems ⋮ Real numbers having ultimately periodic representations in abstract numeration systems ⋮ Properties of a ternary infinite word ⋮ Automatic sequences: from rational bases to trees ⋮ On extended boundary sequences of morphic and Sturmian words ⋮ Alternate Base Numeration Systems ⋮ A Hierarchy of Automaticω-Words having a Decidable MSO Theory ⋮ First-Order Logic and Numeration Systems ⋮ Unnamed Item ⋮ From Combinatorial Games to Shape-Symmetric Morphisms ⋮ ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES ⋮ Additive number theory via automata theory ⋮ Automatic maps in exotic numeration systems ⋮ Deciding game invariance ⋮ Ostrowski numeration systems, addition, and finite automata ⋮ Automatic sequences based on Parry or Bertrand numeration systems ⋮ Extensions and restrictions of Wythoff's game preserving its \(\mathcal P\) positions ⋮ Robustness of Pisot-regular sequences ⋮ Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series ⋮ An extension of the Cobham-Semënov Theorem ⋮ Minimal automaton for multiplying and translating the Thue-Morse set ⋮ Self-similar tiling systems, topological factors and stretching factors ⋮ On recognizable sets of integers ⋮ A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS ⋮ Independent numeration systems and syndeticity ⋮ Regular sequences and synchronized sequences in abstract numeration systems ⋮ Generalization of automatic sequences for numeration systems on a regular language ⋮ Unnamed Item
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
This page was built for publication: Bertrand numeration systems and recognizability
