Dejean's conjecture and Sturmian words

DOI10.1016/J.EJC.2005.11.005zbMATH Open1111.68096DBLPjournals/ejc/Mohammad-NooriC07OpenAlexW2070037875WikidataQ57253994 ScholiaQ57253994MaRDI QIDQ872047FDOQ872047

Cites Work

Cited In (41)

A small morphism for which the fixed point has an abelian critical exponent less than 2
Minimal critical exponent of quasiperiodic words
A Note on a Conjecture of Duval and Sturmian Words
ON THE REPETITIVITY INDEX OF INFINITE WORDS
On the D0L Repetition Threshold
Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture
Branching frequency and Markov entropy of repetition-free languages
The repetition threshold of episturmian sequences
Last cases of Dejean's conjecture
Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings
Asymptotic repetitive threshold of balanced sequences
The undirected repetition threshold and undirected pattern avoidance
Bounds for the generalized repetition threshold
Dejean's conjecture and letter frequency
On minimal critical exponent of balanced sequences
Dejean's conjecture and letter frequency
Highly nonrepetitive sequences: Winning strategies from the local lemma
On repetition thresholds of caterpillars and trees of bounded degree
On the number of $\alpha $-power-free binary words for $2<\alpha \leq 7/3$
Extensions and reductions of squarefree words
AVOIDING APPROXIMATE SQUARES
Dejean's conjecture holds for $n\geq 30$
Une extension d'un théorème de P. Jullien sur les âges de mots
Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words
The weak circular repetition threshold over large alphabets
On a word avoiding near repeats
On the growth rates of complexity of threshold languages
On Dejean's conjecture over large alphabets
The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$
Growth properties of power-free languages
Letter frequency in infinite repetition-free words
On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence
A proof of Dejean’s conjecture
On extremal properties of the Fibonacci word
Extremal overlap-free and extremal $\beta$-free binary words
Dejean's conjecture holds for N ≥ 27
On Pnsiot words avoiding 3-repetitions
Critical Exponents of Regular Arnoux-Rauzy Sequences
The repetition threshold for binary rich words
Least Periods of Factors of Infinite Words

   Recommendations

Last cases of Dejean's conjecture 👍 👎
Proof of Dejean's conjecture for alphabets with $5, 6, 7, 8, 9, 10$ and $11$ letters 👍 👎
On the D0L Repetition Threshold 👍 👎
On the Repetition Threshold for Large Alphabets 👍 👎
Dejean's conjecture and letter frequency 👍 👎

This page was built for publication: Dejean's conjecture and Sturmian words

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