On the subword complexity of DOL languages with a constant distribution
From MaRDI portal
Publication:798008
DOI10.1016/0020-0190(81)90121-6zbMath0546.68062OpenAlexW2010696838MaRDI QIDQ798008
Andrzej Ehrenfeucht, Grzegorz Rozenberg
Publication date: 1981
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(81)90121-6
Related Items (10)
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 ⋮ On the subword complexity of locally catenative 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 ⋮ Infinite words with linear subword complexity ⋮ On the size of the alphabet and the subword complexity of square-free DOL languages
Cites Work
This page was built for publication: On the subword complexity of DOL languages with a constant distribution
