Dejean’s conjecture and Sturmian words
Authors:
- M. Mohammad-NooriMMM. Mohammad-Noori
- James D. CurrieJCJames D. Currie
- 1 April 2007
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 28 (3) , 876-890
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Return words in Sturmian and episturmian wordsRAIRO - Theoretical Informatics and Applications, 2000
- Words Strongly Avoiding Fractional PowersEuropean Journal of Combinatorics, 1999
- Proof of Dejean's conjecture for alphabets with 5, 6, 7, 8, 9, 10 and 11 lettersTheoretical Computer Science, 1992
- Uniformly growing k-th power-free homomorphismsTheoretical Computer Science, 1988
- Multidimensional unrepetitive configurationsTheoretical Computer Science, 1988
- An infinite square-free co-CFLInformation Processing Letters, 1985
- 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
- Characterization of the repetitive commutative semigroupsJournal of Algebra, 1972
- Recurrent geodesics on a surface of negative curvatureTransactions of the American Mathematical Society, 1921