Recommendations
Cites work
- scientific article; zbMATH DE number 992016 (Why is no real title available?)
- scientific article; zbMATH DE number 3904598 (Why is no real title available?)
- scientific article; zbMATH DE number 3972211 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 3324797 (Why is no real title available?)
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Arithmetic progressions in partially ordered sets
- Characterization of the repetitive commutative semigroups
- Intervals in the lattice of varieties
- Multidimensional unrepetitive configurations
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- Return words in Sturmian and episturmian words
- Sur un théorème de Thue
- Uniformly growing k-th power-free homomorphisms
- Words strongly avoiding fractional powers
Cited in
(41)- Dejean's conjecture and letter frequency
- Growth properties of power-free languages
- On Dejean's conjecture over large alphabets
- On extremal properties of the Fibonacci word
- A small morphism for which the fixed point has an abelian critical exponent less than 2
- Branching frequency and Markov entropy of repetition-free languages
- Letter frequency in infinite repetition-free words
- On a word avoiding near repeats
- The repetition threshold of episturmian sequences
- On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
- Bounds for the generalized repetition threshold
- Critical Exponents of Regular Arnoux-Rauzy Sequences
- An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence
- On minimal critical exponent of balanced sequences
- A proof of Dejean’s conjecture
- On the growth rates of complexity of threshold languages
- Minimal critical exponent of quasiperiodic words
- Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings
- Dejean's conjecture holds for \(n\geq 30\)
- Extensions and reductions of squarefree words
- A Note on a Conjecture of Duval and Sturmian Words
- The undirected repetition threshold and undirected pattern avoidance
- Asymptotic repetitive threshold of balanced sequences
- Last cases of Dejean's conjecture
- ON THE REPETITIVITY INDEX OF INFINITE WORDS
- On the D0L Repetition Threshold
- Highly nonrepetitive sequences: winning strategies from the local Lemma
- The number of threshold words on \(n\) letters grows exponentially for every \(n \geq 27\)
- Dejean's conjecture and letter frequency
- On the number of \(\alpha \)-power-free binary words for \(2<\alpha \leq 7/3\)
- Une extension d'un théorème de P. Jullien sur les âges de mots
- Dejean's conjecture holds for N ≥ 27
- The repetition threshold for binary rich words
- On Pnsiot words avoiding 3-repetitions
- Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture
- AVOIDING APPROXIMATE SQUARES
- Extremal overlap-free and extremal \(\beta\)-free binary words
- On repetition thresholds of caterpillars and trees of bounded degree
- Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words
- The weak circular repetition threshold over large alphabets
- Least Periods of Factors of Infinite Words
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)
