Arithmetical complexity of symmetric D0L words
Theoretical Computer Science
On the context-freeness of the set of words containing overlaps
Information Processing Letters
Asymptotic subword complexity of fixed points of group substitutions
Theoretical Computer Science
Subword complexity of uniform D0L words over finite groups
Theoretical Computer Science
On critical exponents in fixed points of binary k-uniform morphisms
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Bispecial factors in circular non-pushy D0L languages
Theoretical Computer Science
| Hi-index | 0.01 |