On Dejean’s conjecture over large alphabets
Author:
- Arturo CarpiACArturo Carpi
- 1 October 2007
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 385 (1-3) , 137-151
Abstract
No abstract availableKeywords
Funding Information
- Ministero dell’Istruzione, dell’Università e della Ricerca
This publication has 8 references indexed in Scilit:
- Dejean’s conjecture and Sturmian wordsEuropean Journal of Combinatorics, 2007
- SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDSInternational Journal of Foundations of Computer Science, 2004
- Polynomial versus exponential growth in repetition-free binary wordsJournal of Combinatorial Theory, Series A, 2004
- Proof of Dejean's conjecture for alphabets with 5, 6, 7, 8, 9, 10 and 11 lettersTheoretical Computer Science, 1992
- MUTUALLY AVOIDING TERNARY WORDS OF SMALL EXPONENTInternational Journal of Algebra and Computation, 1991
- Uniformly growing k-th power-free homomorphismsTheoretical Computer Science, 1988
- 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