On the size of the alphabet and the subword complexity of square-free DOL languages

DOI10.1007/BF02572832zbMath0512.68058OpenAlexW2014919645MaRDI QIDQ1050120

Andrzej Ehrenfeucht, Grzegorz Rozenberg

Publication date: 1983

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/134604

zbMATH Keywords

square-free DOL language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

On the subword complexity of m-free DOL languages ⋮ Subword complexity of uniform D0L words over finite groups ⋮ On the D0L Repetition Threshold ⋮ Asymptotic subword complexity of fixed points of group substitutions

Cites Work

• Unnamed Item
• Unnamed Item
• On the subword complexity of DOL languages with a constant distribution
• Avoidable patterns in strings of symbols
• On the subword complexity of square-free DOL languages

This page was built for publication: On the size of the alphabet and the subword complexity of square-free DOL languages