Subword complexity of a generalized Thue-Morse word

DOI10.1016/0020-0190(95)00074-MzbMath0875.68596OpenAlexW1965328396MaRDI QIDQ672966

John Tromp, Jeffrey O. Shallit

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00074-m

zbMATH Keywords

Thue-Morse wordSubword complexityFormal languages

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items

The subword complexity of a class of infinite binary words ⋮ On the context-freeness of the set of words containing overlaps ⋮ On the growth rate of words in generalized Thue-Morse sequence ⋮ On the structure of compacted subword graphs of Thue-Morse words and their applications ⋮ Non-injectivity of infinite interval exchange transformations and generalized Thue-Morse sequences ⋮ Palindromic closures using multiple antimorphisms ⋮ On the subword complexity of Thue-Morse polynomial extractions ⋮ Generalized Thue-Morse words and palindromic richness ⋮ On winning shifts of marked uniform substitutions ⋮ On some generalizations of the Thue-Morse morphism.

Cites Work

• Unnamed Item
• Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
• The ring of \(k\)-regular sequences
• On the complexity of infinite sequences
• Enumeration of factors in the Thue-Morse word
• Generalized Morse Sequences on n Symbols
• Uniform tag sequences

This page was built for publication: Subword complexity of a generalized Thue-Morse word