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

DOI10.1016/J.TCS.2011.08.006zbMATH Open1231.68189OpenAlexW2042822833MaRDI QIDQ650879FDOQ650879

Authors Roman Kolpakov, Michaël Rao

Publication date 7 December 2011

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2011.08.006

zbMATH Keywords

combinatorics on wordsgrowth ratesrepetitions

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
• Dejean's conjecture and Sturmian words
• On Dejean's conjecture over large alphabets
• Finite repetition threshold for large alphabets
• The number of threshold words on \(n\) letters grows exponentially for every \(n \geq 27\)

Cites work

• scientific article; zbMATH DE number 3912631 (Why is no real title available?)
• A proof of Dejean’s conjecture
• A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
• Dejean's conjecture and Sturmian words
• Dejean's conjecture holds for N ≥ 27
• Dejean's conjecture holds for \(n\geq 30\)
• Efficient lower bounds on the number of repetition-free words
• Growth of repetition-free words -- a review
• Last cases of Dejean's conjecture
• NON-REPETITIVE SEQUENCES ON THREE SYMBOLS
• On Dejean's conjecture over large alphabets
• On the entropy and letter frequencies of powerfree words
• Overlap-free words and finite automata
• Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
• Sur un théorème de Thue
• The entropy of square-free words
• Two-Sided Bounds for the Growth Rates of Power-Free Languages

Cited in

(11)

• Growth properties of power-free languages
• Doubled patterns are 3-avoidable
• On an efficient method for estimating the number of nonrepeating words
• Branching frequency and Markov entropy of repetition-free languages
• Avoiding or limiting regularities in words
• Enumeration of irreducible binary words
• The number of threshold words on \(n\) letters grows exponentially for every \(n \geq 27\)
• Dejean's conjecture and letter frequency
• Avoidability of circular formulas
• Subword complexity and power avoidance
• Transition property for cube-free words

This page was built for publication: On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650879)