Proof of Dejean's conjecture for alphabets with 5, 6, 7, 8, 9, 10 and 11 letters

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

A generalization of repetition threshold

Theoretical Computer Science - Mathematical foundations of computer science 2004

Dejean's conjecture and Sturmian words

European Journal of Combinatorics

Letter frequency in infinite repetition-free words

Theoretical Computer Science

On Dejean's conjecture over large alphabets

Theoretical Computer Science

On a word avoiding near repeats

Information Processing Letters

Dejean's conjecture holds for n≥30

Theoretical Computer Science

Avoiding approximate squares

DLT'07 Proceedings of the 11th international conference on Developments in language theory

Last cases of Dejean's conjecture

Theoretical Computer Science

Bounds for the generalized repetition threshold

Theoretical Computer Science

On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters

Theoretical Computer Science

On the repetition threshold for large alphabets

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

Subwords and Power-Free Words are not Expressible by Word Equations

Fundamenta Informaticae