scientific article; zbMATH DE number 7089069

MaRDI QIDQ5227519zbMATH OpenFDO

Authors Victor Marsault

Publication date 6 August 2019

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Recommendations

• An efficient algorithm to decide periodicity of \(b\)-recognisable sets using MSDF convention
• Ultimate periodicity of \(b\)-recognisable sets: a quasilinear procedure
• Syntactic complexity of ultimately periodic sets of integers and application to a decision procedure
• Information Security and Cryptology
• A fast algorithm for determining the linear complexity in periodic sequences
• On automata recognizing birecurrent sets
• scientific article; zbMATH DE number 1955778
• On the classification of \(LS\)-sequences
• Periodicity algorithms and a conjecture on overlaps in partial words
• Decidability, Recursive Enumerability and Kleene Hierarchy ForL-Subsets

Cites work

• scientific article; zbMATH DE number 5707089 (Why is no real title available?)
• scientific article; zbMATH DE number 5643878 (Why is no real title available?)
• scientific article; zbMATH DE number 1916667 (Why is no real title available?)
• A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS
• A decision method for the recognizability of sets defined by number systems
• Abstract numeration systems
• An efficient algorithm to decide periodicity of \(b\)-recognisable sets using MSDF convention
• Automatic Sequences
• Diophantine equations, Presburger arithmetic and finite automata
• Enumeration and decidable properties of automatic sequences
• Introduction to algorithms.
• Logic and p-recognizable sets of integers
• Number representation and finite automata
• On the base-dependence of sets of numbers recognizable by finite automata
• Periodicity, repetitions, and orbits of an automatic sequence
• Presburgerness of predicates regular in two number systems
• Semigroups, Presburger formulas, and languages
• The definable criterion for definability in Presburger arithmetic and its applications.
• Ultimate periodicity of \(b\)-recognisable sets: a quasilinear procedure
• Weak Second‐Order Arithmetic and Finite Automata

Cited in

(8)

• Magic Numbers in Periodic Sequences
• Syntactic complexity of ultimately periodic sets of integers and application to a decision procedure
• Syntactic complexity of ultimately periodic sets of integers
• Ultimate periodicity problem for linear numeration systems
• Ultimate periodicity of \(b\)-recognisable sets: a quasilinear procedure
• An efficient algorithm to decide periodicity of \(b\)-recognisable sets using MSDF convention
• Minimal automaton for multiplying and translating the Thue-Morse set
• Euclidean division by \(d\) in base \(b\)

This page was built for publication:

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