Polynomial versus exponential growth in repetition-free binary words
Journal of Combinatorial Theory Series A
Theoretical Computer Science - The art of theory
Growth of repetition-free words: a review
Theoretical Computer Science - The art of theory
On the context-freeness of the set of words containing overlaps
Information Processing Letters
Overlap-freeness in infinite partial words
Theoretical Computer Science
On the number of α-power-free binary words for 2
Theoretical Computer Science
Overlap-free words and spectra of matrices
Theoretical Computer Science
Computing the growth of the number of overlap-free words with spectra of matrices
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Growth properties of power-free languages
DLT'11 Proceedings of the 15th international conference on Developments in language theory
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Words avoiding 7/3-powers and the Thue-Morse morphism
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
On two stronger versions of dejean's conjecture
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.04 |