Special factors of automatic sequences

DOI10.1016/0022-4049(95)00043-7zbMath0856.11012OpenAlexW2048376146MaRDI QIDQ1917395

Théodore Tapsoba

Publication date: 2 March 1997

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-4049(95)00043-7

zbMATH Keywords

complexity of a sequenceextendable wordsrythmical wordspecial factors of infinite fixed points of morphisms

Mathematics Subject Classification ID

Combinatorics on words (68R15) Automata sequences (11B85)

Related Items

Minimum complexity of automatic non sturmian sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
• Automata calculating the complexity of automatic sequences
• Enumeration of factors in the Thue-Morse word
• Suites algébriques, automates et substitutions
• Représentation géométrique de suites de complexité $2n+1$
• Uniform tag sequences