Ultimate periodicity problem for linear numeration systems

DOI10.1142/S0218196722500254MaRDI QIDQ5075706

Émilie Charlier, Adeline Massuir, Michel Rigo, Eric S. Rowland

Publication date: 11 May 2022

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

Full work available at URL: https://arxiv.org/abs/2007.08147

zbMATH Keywords

automata theorydecision problem\(p\)-adic valuationnumeration systemlinear recurrent sequence

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(p\)-adic asymptotic properties of constant-recursive sequences
• How to write integers in a non-integral basis
• Logic and \(p\)-recognizable sets of integers
• Numeration systems, linear recurrences, and regular sets
• \(p\)-adic numbers: An introduction.
• On the sequentiality of the successor function
• Greedy numeration systems and regularity
• Bertrand numeration systems and recognizability
• \(\beta\)-shift, numeration systems, and automata
• On Cobham's theorem
• On almost periodicity of morphic sequences
• A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS
• Systems of Numeration
• A decision method for the recognizability of sets defined by number systems
• Representations of numbers and finite automata
• ON MAHLER’S CLASSIFICATION OF -ADIC NUMBERS
• Decidability of the HD0L ultimate periodicity problem
• An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention
• On the Positivity Problem for Simple Linear Recurrence Sequences,
• Formal Languages, Automata and Numeration Systems 2
• Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure
• Positivity Problems for Low-Order Linear Recurrence Sequences
• On the base-dependence of sets of numbers recognizable by finite automata
• Numeration systems on a regular language

This page was built for publication: Ultimate periodicity problem for linear numeration systems