Some results on k-power-free morphisms
Theoretical Computer Science
Binary Patterns in Infinite Binary Words
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Binary patterns in infinite binary words
Formal and natural computing
On critical exponents in fixed points of non-erasing morphisms
Theoretical Computer Science
Existence of finite test-sets for k-power-freeness of uniform morphisms
Discrete Applied Mathematics
Periodicity, repetitions, and orbits of an automatic sequence
Theoretical Computer Science
On the joint subword complexity of automatic sequences
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
Fixed points avoiding Abelian k-powers
Journal of Combinatorial Theory Series A
On critical exponents in fixed points of non-erasing morphisms
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Bispecial factors in circular non-pushy D0L languages
Theoretical Computer Science
Ancestors graph and an upper bound for the subword complexity function
Theoretical Computer Science
| Hi-index | 0.01 |