Syntactic Complexity of Ultimately Periodic Sets of Integers

DOI10.1007/978-3-642-21254-3_38zbMath1330.68178OpenAlexW1713868372MaRDI QIDQ3004606

É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

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

Related Items (1)

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