On the subword complexity of locally catenative DOL languages

DOI10.1016/0020-0190(83)90003-0zbMath0501.68038OpenAlexW2061655701MaRDI QIDQ1172397

Andrzej Ehrenfeucht, Grzegorz Rozenberg

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0020-0190(83)90003-0

zbMATH Keywords

formal languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Subword topology ⋮ 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

• On the subword complexity of DOL languages with a constant distribution
• On the subword complexity of square-free DOL languages
• Unnamed Item
• Unnamed Item

This page was built for publication: On the subword complexity of locally catenative DOL languages