The subword complexity of fixed points of binary uniform morphisms

DOI10.1007/BFb0036182OpenAlexW1511597893MaRDI QIDQ5055933

Anna E. Frid

Publication date: 9 December 2022

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0036182

Mathematics Subject Classification ID

Combinatorics on words (68R15) Grammars and rewriting systems (68Q42)

Related Items (3)

Computing abelian complexity of binary uniform morphic words ⋮ On the context-freeness of the set of words containing overlaps ⋮ On the asymptotic abelian complexity of morphic words

Cites Work

• Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
• Power of words and recognizability of fixpoints of a substitution
• Automata calculating the complexity of automatic sequences
• Enumeration of factors in the Thue-Morse word
• If a DOL language is k-power free then it is circular
• Reconnaissabilité des substitutions et complexité des suites automatiques
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The subword complexity of fixed points of binary uniform morphisms