Separators in infinite words generated by morphisms.

DOI10.1016/S0304-3975(97)83808-XzbMath1044.68712MaRDI QIDQ1390860

Emmanuelle Garel

Publication date: 22 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Automata sequences (11B85)

Related Items

How to prove that a sequence is not automatic ⋮ ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES ⋮ On synchronized sequences and their separators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite automata in number theory
• Wire bending
• Folds! III: More morphisms
• The ring of \(k\)-regular sequences
• Power of words and recognizability of fixpoints of a substitution
• Automata calculating the complexity of automatic sequences
• Dimension des courbes planes, papiers plies et suites de Rudin-Shapiro
• Suites algébriques, automates et substitutions
• If a DOL language is k-power free then it is circular
• Reconnaissabilité des substitutions et complexité des suites automatiques
• Uniform tag sequences