scientific article; zbMATH DE number 7089069

zbMath1437.68102arXiv1708.06228MaRDI QIDQ5227519

Victor Marsault

Publication date: 6 August 2019

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

automatainteger-base systemsrecognisable setsperiodic sets: least-significant-digit-first encodings

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35) Automata sequences (11B85)

Related Items

Ultimate periodicity problem for linear numeration systems ⋮ Magic Numbers in Periodic Sequences ⋮ Minimal automaton for multiplying and translating the Thue-Morse set

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Presburgerness of predicates regular in two number systems
• Logic and \(p\)-recognizable sets of integers
• The definable criterion for definability in Presburger arithmetic and its applications.
• Periodicity, repetitions, and orbits of an automatic sequence
• Semigroups, Presburger formulas, and languages
• Weak Second‐Order Arithmetic and Finite Automata
• A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS
• A decision method for the recognizability of sets defined by number systems
• Automatic Sequences
• ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
• An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention
• Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure
• Number representation and finite automata
• Abstract numeration systems
• On the base-dependence of sets of numbers recognizable by finite automata
• Diophantine equations, Presburger arithmetic and finite automata