Last cases of Dejean’s conjecture
Author:
- Michaël RaoMRMichaël Rao
- 1 June 2011
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 412 (27) , 3010-3018
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A proof of Dejean’s conjectureMathematics of Computation, 2010
- Dejean's conjecture holds for N ≥ 27RAIRO - Theoretical Informatics and Applications, 2009
- Dejean’s conjecture holds forTheoretical Computer Science, 2009
- Dejean's conjecture and letter frequencyRAIRO - Theoretical Informatics and Applications, 2008
- On Dejean’s conjecture over large alphabetsTheoretical Computer Science, 2007
- Letter frequency in infinite repetition-free wordsTheoretical Computer Science, 2007
- Dejean’s conjecture and Sturmian wordsEuropean Journal of Combinatorics, 2007
- Proof of Dejean's conjecture for alphabets with 5, 6, 7, 8, 9, 10 and 11 lettersTheoretical Computer Science, 1992
- A propos d'une conjecture de F. Dejean sur les répétitions dans les motsDiscrete Applied Mathematics, 1984
- Sur un théorème de ThueJournal of Combinatorial Theory, Series A, 1972