A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS
From MaRDI portal
Publication:3643584
DOI10.1142/S0218196709005330zbMath1194.68131MaRDI QIDQ3643584
Émilie Charlier, Aviezri S. Fraenkel, Michel Rigo, Jason P. Bell
Publication date: 9 November 2009
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
periodicitydecidability\(p\)-adic numberslinear recurrencefinite automatanumeration systemrecognizable set of integers
Formal languages and automata (68Q45) Decidability (number-theoretic aspects) (11U05) Automata sequences (11B85) Other nonanalytic theory (11S85)
Related Items (4)
Automatic sequences of rank two ⋮ Effective S-adic Symbolic Dynamical Systems ⋮ Ultimate periodicity problem for linear numeration systems ⋮ Unnamed Item
Cites Work
- Unnamed Item
- How to write integers in a non-integral basis
- Some \(q\)-analogues of the Schröder numbers arising from combinatorial statistics on lattice paths
- Numeration systems, linear recurrences, and regular sets
- On the sequentiality of the successor function
- Greedy numeration systems and regularity
- Bertrand numeration systems and recognizability
- The definable criterion for definability in Presburger arithmetic and its applications.
- On the recurrence \(f_{m+1}=b_m f_m-f_{m-1}\) and applications
- Arrays, numeration systems and Frankenstein games
- Decidability questions related to abstract numeration systems
- Minimal DFA for testing divisibility
- Periodicity, repetitions, and orbits of an automatic sequence
- Systems of Numeration
- On the periodicity of morphisms on free monoids
- A decision method for the recognizability of sets defined by number systems
- On irregularities of distribution of real sequences
- Representations of numbers and finite automata
- Automatic Sequences
- A theorem of Cobham for non-primitive substitutions
- Decidability of periodicity for infinite words
- On the base-dependence of sets of numbers recognizable by finite automata
- Numeration systems on a regular language
- Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series
This page was built for publication: A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS
