Polynomial versus exponential growth in repetition-free binary words
Journal of Combinatorial Theory Series A
Overlap-free morphisms and finite test-sets
Discrete Applied Mathematics
On the number of α-power-free binary words for 2
Theoretical Computer Science
Growth rates of complexity of power-free languages
Theoretical Computer Science
On the complexity of deciding avoidability of sets of partial words
Theoretical Computer Science
Growth properties of power-free languages
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Factorial languages of low combinatorial complexity
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
The entropy of square-free words
Mathematical and Computer Modelling: An International Journal
Hi-index | 5.23 |