A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS

DOI10.1142/S0218196709005330MaRDI QIDQ3643584zbMATH OpenFDO

Authors Émilie Charlier, Aviezri S. Fraenkel, Jason P. Bell, Michel Rigo

Publication date 9 November 2009

Published in International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0218196709005330

zbMATH Keywords

\(p\)-adic numbersdecidabilityfinite automatalinear recurrencenumeration systemperiodicityrecognizable set of integers

Mathematics Subject Classification ID

Automata sequences (11B85) Other nonanalytic theory (11S85) Decidability (number-theoretic aspects) (11U05) Formal languages and automata (68Q45)

Recommendations

• A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems
• Recognizable sets of numbers in nonstandard bases
• Decidability questions related to abstract numeration systems
• Abstract numeration systems
• Ultimate periodicity of b-recognisable sets: a quasilinear procedure

Cites work

• A decision method for the recognizability of sets defined by number systems
• A theorem of Cobham for non-primitive substitutions
• Arrays, numeration systems and Frankenstein games
• Automatic Sequences
• Bertrand numeration systems and recognizability
• Decidability of periodicity for infinite words
• Decidability questions related to abstract numeration systems
• Greedy numeration systems and regularity
• How to write integers in a non-integral basis
• scientific article; zbMATH DE number 5643878 (Why is no real title available?)
• Minimal DFA for testing divisibility
• Numeration systems on a regular language
• Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series
• Numeration systems, linear recurrences, and regular sets
• On irregularities of distribution of real sequences
• On the base-dependence of sets of numbers recognizable by finite automata
• On the periodicity of morphisms on free monoids
• On the recurrence \(f_{m+1}=b_m f_m-f_{m-1}\) and applications
• On the sequentiality of the successor function
• Periodicity, repetitions, and orbits of an automatic sequence
• Representations of numbers and finite automata
• Some \(q\)-analogues of the Schröder numbers arising from combinatorial statistics on lattice paths
• Systems of Numeration
• The definable criterion for definability in Presburger arithmetic and its applications.

Cited in

(6)

• Effective S-adic symbolic dynamical systems
• A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems
• Automatic sequences of rank two
• Ultimate periodicity problem for linear numeration systems
• Recognizable sets of numbers in nonstandard bases
• scientific article; zbMATH DE number 7089069 (Why is no real title available?)

This page was built for publication: A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3643584)