Automata calculating the complexity of automatic sequences

DOI10.5802/jtnb.109zbMath0815.11015OpenAlexW2314536985MaRDI QIDQ1340682

Théodore Tapsoba

Publication date: 9 July 1995

Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=JTNB_1994__6_1_127_0

zbMATH Keywords

complexityThue-Morse sequenceautomatic sequences

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Automata sequences (11B85)

Related Items

Automata calculating the complexity of automatic sequences ⋮ The subword complexity of fixed points of binary uniform morphisms ⋮ On the context-freeness of the set of words containing overlaps ⋮ Special factors of automatic sequences ⋮ Separators in infinite words generated by morphisms. ⋮ Minimum complexity of automatic non sturmian sequences ⋮ The ring of \(k\)-regular sequences ⋮ Subword complexity of uniform D0L words over finite groups ⋮ On the D0L Repetition Threshold ⋮ Asymptotic subword complexity of fixed points of group substitutions ⋮ Complexity of generalized Rudin-Shapiro sequences

Cites Work

• 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
• Uniform tag sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item