On the subword complexity of m-free DOL languages
From MaRDI portal
Publication:594602
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
Related Items
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