The subword complexity of fixed points of binary uniform morphisms
From MaRDI portal
Recommendations
Cites work
- Automata calculating the complexity of automatic sequences
- Enumeration of factors in the Thue-Morse word
- scientific article; zbMATH DE number 1037960 (Why is no real title available?)
- scientific article; zbMATH DE number 808803 (Why is no real title available?)
- scientific article; zbMATH DE number 5051582 (Why is no real title available?)
- If a DOL language is k-power free then it is circular
- Power of words and recognizability of fixpoints of a substitution
- Reconnaissabilité des substitutions et complexité des suites automatiques
- Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
Cited in
(15)- Asymptotic subword complexity of fixed points of group substitutions
- Ancestors graph and an upper bound for the subword complexity function
- On the asymptotic abelian complexity of morphic words
- Computing abelian complexity of binary uniform morphic words
- Permutation complexity of the fixed points of some uniform binary morphisms
- scientific article; zbMATH DE number 1375592 (Why is no real title available?)
- scientific article; zbMATH DE number 1740040 (Why is no real title available?)
- scientific article; zbMATH DE number 1037960 (Why is no real title available?)
- scientific article; zbMATH DE number 808803 (Why is no real title available?)
- Binary recurrent words of ultimate complexity n+2
- On the subword complexity of iteratively generated infinite words.
- Subword complexity of uniform D0L words over finite groups
- On the subword complexity of DOL languages with a constant distribution
- On k-repetition freeness of length uniform morphisms over a binary alphabet
- On the context-freeness of the set of words containing overlaps
This page was built for publication: The subword complexity of fixed points of binary uniform morphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055933)
