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

DOI10.1016/j.tcs.2011.08.006zbMath1231.68189OpenAlexW2042822833MaRDI QIDQ650879

Michaël Rao, Roman M. Kolpakov

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

growth ratesrepetitionscombinatorics on words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (8)

Branching frequency and Markov entropy of repetition-free languages ⋮ Doubled patterns are 3-avoidable ⋮ Avoiding or Limiting Regularities in Words ⋮ Growth properties of power-free languages ⋮ Avoidability of circular formulas ⋮ The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$ ⋮ Transition property for cube-free words ⋮ Subword complexity and power avoidance

Cites Work

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

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