A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
From MaRDI portal
(Redirected from Publication:792102)
Recommendations
Cites work
- scientific article; zbMATH DE number 3661611 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3028781 (Why is no real title available?)
- Mots sans carre et morphismes iterés
- On repetitions of blocks in binary sequences
- On the subword complexity of square-free DOL languages
- Subword complexities of various classes of deterministic developmental languages without interactions
- Sur un théorème de Thue
- Unending chess, symbolic dynamics and a problem in semi-groups
- Uniformly growing k-th power-free homomorphisms
Cited in
(61)- A small morphism for which the fixed point has an abelian critical exponent less than 2
- Finite repetition threshold for large alphabets
- Minimal critical exponent of quasiperiodic words
- On the D0L Repetition Threshold
- ON THE REPETITIVITY INDEX OF INFINITE WORDS
- Branching frequency and Markov entropy of repetition-free languages
- Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture
- Last cases of Dejean's conjecture
- On repeated factors in \(C^\infty\)-words
- Transition Property for $$\alpha $$-Power Free Languages with $$\alpha \ge 2$$ and $$k\ge 3$$ Letters
- The repetition threshold of episturmian sequences
- The undirected repetition threshold and undirected pattern avoidance
- Bounds for the generalized repetition threshold
- Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings
- Asymptotic repetitive threshold of balanced sequences
- Repetitions in words
- Dejean's conjecture and Sturmian words
- Every real number greater than 1 is a critical exponent
- On minimal critical exponent of balanced sequences
- Dejean's conjecture and letter frequency
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- Dejean's conjecture and letter frequency
- Inner palindromic closure
- A ternary square-free sequence avoiding factors equivalent to abcacba
- On repetition thresholds of caterpillars and trees of bounded degree
- Repetition threshold for circular words
- Subword complexity and power avoidance
- Extensions and reductions of squarefree words
- AVOIDING APPROXIMATE SQUARES
- Dejean's conjecture holds for \(n\geq 30\)
- On a word avoiding near repeats
- Une extension d'un théorème de P. Jullien sur les âges de mots
- The weak circular repetition threshold over large alphabets
- On the growth rates of complexity of threshold languages
- On Dejean's conjecture over large alphabets
- Growth properties of power-free languages
- On highly repetitive and power free words
- Letter frequency in infinite repetition-free words
- Words strongly avoiding fractional powers
- Repetition avoidance in products of factors
- On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
- On the tree of ternary square-free words
- An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence
- Growth of repetition-free words -- a review
- Approaching repetition thresholds via local resampling and entropy compression
- A proof of Dejean’s conjecture
- A generator of morphisms for infinite words
- Repetition-free words
- On extremal properties of the Fibonacci word
- Extremal overlap-free and extremal -free binary words
- Pattern avoidance: themes and variations
- On Pnsiot words avoiding 3-repetitions
- Dejean's conjecture holds for N ≥ 27
- Avoiding letter patterns in ternary square-free words
- Non-constructive upper bounds for repetition thresholds
- On two stronger versions of Dejean's conjecture
- Critical Exponents of Regular Arnoux-Rauzy Sequences
- Multidimensional unrepetitive configurations
- The number of threshold words on \(n\) letters grows exponentially for every \(n \geq 27\)
- The repetition threshold for binary rich words
- Abelian repetition threshold revisited
This page was built for publication: A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792102)