On the subword complexity of square-free DOL languages
From MaRDI portal
Publication:1162365
DOI10.1016/0304-3975(81)90028-1zbMath0481.68073OpenAlexW1987010753MaRDI QIDQ1162365
Andrzej Ehrenfeucht, Grzegorz Rozenberg
Publication date: 1981
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(81)90028-1
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)
Related Items (20)
Repetition-free words ⋮ Computing abelian complexity of binary uniform morphic words ⋮ On the subword complexity of m-free DOL languages ⋮ A combinatorial theorem on $p$-power-free words and an application to semigroups ⋮ On the asymptotic abelian complexity of morphic words ⋮ Properties of infinite words : Recent results ⋮ On the subword complexity of locally catenative DOL languages ⋮ If a DOL language is k-power free then it is circular ⋮ Unnamed Item ⋮ Subword complexity of uniform D0L words over finite groups ⋮ On the D0L Repetition Threshold ⋮ Asymptotic subword complexity of fixed points of group substitutions ⋮ Unnamed Item ⋮ Repetitiveness of languages generated by morphisms ⋮ On cube-free \(\omega\)-words generated by binary morphisms ⋮ Uniformly growing k-th power-free homomorphisms ⋮ On the size of the alphabet and the subword complexity of square-free DOL languages ⋮ A propos d'une conjecture de F. Dejean sur les répétitions dans les mots ⋮ On the subword complexity of DOL languages with a constant distribution ⋮ On regularity of languages generated by copying systems
Cites Work
This page was built for publication: On the subword complexity of square-free DOL languages
