On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
From MaRDI portal
Publication:650879
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
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
- Two-Sided Bounds for the Growth Rates of Power-Free Languages
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- Dejean's conjecture holds for \(n\geq 30\)
- On Dejean's conjecture over large alphabets
- Sur un théorème de Thue
- A proof of Dejean’s conjecture
- Dejean's conjecture holds for N ≥ 27
- Last cases of Dejean's conjecture
- Dejean's conjecture and Sturmian words
- Growth of repetition-free words -- a review
- NON-REPETITIVE SEQUENCES ON THREE SYMBOLS
- Title not available (Why is that?)
- Efficient lower bounds on the number of repetition-free words
- Overlap-free words and finite automata
- The entropy of square-free words
- On the entropy and letter frequencies of powerfree words
Cited In (11)
- On an efficient method for estimating the number of nonrepeating words
- Branching frequency and Markov entropy of repetition-free languages
- Dejean's conjecture and letter frequency
- Avoidability of circular formulas
- Subword complexity and power avoidance
- The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$
- Growth properties of power-free languages
- Transition property for cube-free words
- Avoiding or Limiting Regularities in Words
- Enumeration of irreducible binary words
- Doubled patterns are 3-avoidable
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)
