A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
From MaRDI portal
Publication:792102
DOI10.1016/0166-218X(84)90006-4zbMath0536.68072WikidataQ57253992 ScholiaQ57253992MaRDI QIDQ792102
Publication date: 1984
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Artificial intelligence (68T99) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (53)
Repetition-free words ⋮ Transition Property for $$\alpha $$-Power Free Languages with $$\alpha \ge 2$$ and $$k\ge 3$$ Letters ⋮ Branching frequency and Markov entropy of repetition-free languages ⋮ A ternary square-free sequence avoiding factors equivalent to \(abcacba\) ⋮ A proof of Dejean’s conjecture ⋮ On repeated factors in \(C^\infty\)-words ⋮ On the Tree of Ternary Square-Free Words ⋮ Letter frequency in infinite repetition-free words ⋮ Avoiding letter patterns in ternary square-free words ⋮ Multidimensional unrepetitive configurations ⋮ Dejean's conjecture and Sturmian 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 ⋮ Approaching repetition thresholds via local resampling and entropy compression ⋮ 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 ⋮ Words strongly avoiding fractional powers ⋮ On Dejean's conjecture over large alphabets ⋮ Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters ⋮ On repetition thresholds of caterpillars and trees of bounded degree ⋮ Growth of repetition-free words -- a review ⋮ Bounds for the generalized repetition threshold ⋮ Last cases of Dejean's conjecture ⋮ Pattern avoidance: themes and variations ⋮ The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$ ⋮ Dejean's conjecture holds for \(n\geq 30\) ⋮ Repetition avoidance in products of factors ⋮ On the growth rates of complexity of threshold languages ⋮ On a word avoiding near repeats ⋮ On the D0L Repetition Threshold ⋮ Every real number greater than 1 is a critical exponent ⋮ 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 ⋮ Subword complexity and power avoidance ⋮ INNER PALINDROMIC CLOSURE ⋮ A generator of morphisms for infinite words ⋮ A generalization of repetition threshold ⋮ Abelian repetition threshold revisited ⋮ The weak circular repetition threshold over large alphabets ⋮ Asymptotic repetitive threshold of balanced sequences
Cites Work
- Mots sans carre et morphismes iterés
- On the subword complexity of square-free DOL languages
- Subword complexities of various classes of deterministic developmental languages without interactions
- On repetitions of blocks in binary sequences
- Uniformly growing k-th power-free homomorphisms
- Sur un théorème de Thue
- Unending chess, symbolic dynamics and a problem in semi-groups
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
