Syntactic complexity of ultimately periodic sets of integers

DOI10.1007/978-3-642-21254-3_38zbMATH Open1330.68178OpenAlexW1713868372MaRDI QIDQ3004606FDOQ3004606

Authors: Élise Vandomme, Michel Rigo 

Publication date: 3 June 2011

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21254-3_38

Recommendations

• Syntactic complexity of ultimately periodic sets of integers and application to a decision procedure
• On the recognizability of self-generating sets
• Ultimate periodicity of \(b\)-recognisable sets: a quasilinear procedure
• scientific article; zbMATH DE number 7089069
• An efficient algorithm to decide periodicity of \(b\)-recognisable sets using MSDF convention

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15) Semigroups in automata theory, linguistics, etc. (20M35)

Cited In (6)

• Syntactic complexity of ultimately periodic sets of integers and application to a decision procedure
• A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences
• 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
• Periodic sets of integers

This page was built for publication: Syntactic complexity of ultimately periodic sets of integers

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