Ultimate periodicity problem for linear numeration systems

DOI10.1142/S0218196722500254MaRDI QIDQ5075706zbMATH OpenFDO

Authors Émilie Charlier, Adeline Massuir, Michel Rigo, Eric 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

\(p\)-adic valuationautomata theorydecision problemlinear recurrent sequencenumeration system

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
• A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS
• Ultimate periodicity of b-recognisable sets: a quasilinear procedure
• scientific article; zbMATH DE number 7089069
• Numeration systems, linear recurrences, and regular sets

Cites work

• \(\beta\)-shift, numeration systems, and automata
• \(p\)-adic asymptotic properties of constant-recursive sequences
• \(p\)-adic numbers: An introduction.
• A decision method for the recognizability of sets defined by number systems
• A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS
• An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention
• Bertrand numeration systems and recognizability
• Decidability of the HD0L ultimate periodicity problem
• Effective divergence analysis for linear recurrence sequences
• Elements of automata theory. Translated from the French by Reuben Thomas
• Formal languages, automata and numeration systems. Vol. 2. Applications to recognizability and decidability
• Greedy numeration systems and regularity
• How to write integers in a non-integral basis
• scientific article; zbMATH DE number 5707089 (Why is no real title available?)
• scientific article; zbMATH DE number 3588051 (Why is no real title available?)
• scientific article; zbMATH DE number 7089069 (Why is no real title available?)
• scientific article; zbMATH DE number 3057883 (Why is no real title available?)
• Logic and p-recognizable sets of integers
• Numeration systems on a regular language
• Numeration systems, linear recurrences, and regular sets
• On almost periodicity of morphic sequences
• On Cobham's theorem
• On Mahler's classification of p-adic numbers
• On the base-dependence of sets of numbers recognizable by finite automata
• On the positivity problem for simple linear recurrence sequences
• On the sequentiality of the successor function
• Positivity problems for low-order linear recurrence sequences
• Representations of numbers and finite automata
• Syntactic complexity of ultimately periodic sets of integers and application to a decision procedure
• Systems of Numeration
• Ultimate periodicity of b-recognisable sets: a quasilinear procedure

Cited in

(2)

• Syntactic complexity of ultimately periodic sets of integers and application to a decision procedure
• On multiplicatively dependent linear numeration systems, and periodic points

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

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