On the subword complexity of m-free DOL languages

DOI10.1016/0020-0190(83)90050-9zbMath0526.68067OpenAlexW1999191302MaRDI QIDQ594602

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)90050-9

zbMATH Keywords

subword complexityDOL languages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (5)

Computing abelian complexity of binary uniform morphic words ⋮ On the asymptotic abelian complexity of morphic words ⋮ 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 size of the alphabet and the subword complexity of square-free DOL languages
• On the subword complexity of square-free DOL languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the subword complexity of m-free DOL languages