The ring of k-regular sequences, II
Theoretical Computer Science - WORDS
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
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
Joint Spectral Characteristics of Matrices: A Conic Programming Approach
SIAM Journal on Matrix Analysis and Applications
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
Hi-index | 0.00 |