Syntactic complexity of ultimately periodic sets of integers

DOI10.1007/978-3-642-21254-3_38MaRDI QIDQ3004606zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(6)

• Minimal automaton for multiplying and translating the Thue-Morse set
• 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
• Periodic sets of integers
• A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences

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)