Polynomial versus exponential growth in repetition-free binary words
Journal of Combinatorial Theory Series A
Pattern avoidance: themes and variations
Theoretical Computer Science - Combinatorics on words
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-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 rates of complexity of power-free languages
Theoretical Computer Science
Growth properties of power-free languages
DLT'11 Proceedings of the 15th international conference on Developments in language theory
| Hi-index | 0.05 |