Dejean's conjecture and Sturmian words
From MaRDI portal
Publication:872047
DOI10.1016/j.ejc.2005.11.005zbMath1111.68096OpenAlexW2070037875WikidataQ57253994 ScholiaQ57253994MaRDI QIDQ872047
Morteza Mohammad-Noori, James D. Currie
Publication date: 27 March 2007
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2005.11.005
Related Items
Branching frequency and Markov entropy of repetition-free languages ⋮ A proof of Dejean’s conjecture ⋮ Letter frequency in infinite repetition-free words ⋮ The undirected repetition threshold and undirected pattern avoidance ⋮ On minimal critical exponent of balanced sequences ⋮ Minimal critical exponent of quasiperiodic words ⋮ Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture ⋮ Critical Exponents of Regular Arnoux-Rauzy Sequences ⋮ Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings ⋮ Extensions and reductions of squarefree words ⋮ An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence ⋮ Extremal overlap-free and extremal \(\beta\)-free binary words ⋮ On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters ⋮ On extremal properties of the Fibonacci word ⋮ Growth properties of power-free languages ⋮ AVOIDING APPROXIMATE SQUARES ⋮ On Dejean's conjecture over large alphabets ⋮ Least Periods of Factors of Infinite Words ⋮ On repetition thresholds of caterpillars and trees of bounded degree ⋮ Bounds for the generalized repetition threshold ⋮ Last cases of Dejean's conjecture ⋮ The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$ ⋮ On the number of \(\alpha \)-power-free binary words for \(2<\alpha \leq 7/3\) ⋮ Dejean's conjecture holds for \(n\geq 30\) ⋮ On the growth rates of complexity of threshold languages ⋮ On a word avoiding near repeats ⋮ On the D0L Repetition Threshold ⋮ Highly nonrepetitive sequences: Winning strategies from the local lemma ⋮ The repetition threshold for binary rich words ⋮ ON THE REPETITIVITY INDEX OF INFINITE WORDS ⋮ Dejean's conjecture and letter frequency ⋮ Dejean's conjecture and letter frequency ⋮ Dejean's conjecture holds for N ≥ 27 ⋮ ON PANSIOT WORDS AVOIDING 3-REPETITIONS ⋮ The weak circular repetition threshold over large alphabets ⋮ Asymptotic repetitive threshold of balanced sequences
Cites Work
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Arithmetic progressions in partially ordered sets
- Multidimensional unrepetitive configurations
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- Intervals in the lattice of varieties
- Uniformly growing k-th power-free homomorphisms
- Words strongly avoiding fractional powers
- Sur un théorème de Thue
- Characterization of the repetitive commutative semigroups
- Return words in Sturmian and episturmian words
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
