Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
From MaRDI portal
Publication:1184978
DOI10.1016/0304-3975(92)90264-GzbMath0745.68085OpenAlexW2037721291WikidataQ57253993 ScholiaQ57253993MaRDI QIDQ1184978
Publication date: 28 June 1992
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(92)90264-g
Related Items (51)
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 proof of Dejean’s conjecture ⋮ On repeated factors in \(C^\infty\)-words ⋮ Letter frequency in infinite repetition-free words ⋮ \((2+\epsilon )\)-nonrepetitive list colouring of paths ⋮ Avoidance bases for formulas with reversal ⋮ 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 ⋮ Thue type problems for graphs, points, and numbers ⋮ On repetition thresholds of caterpillars and trees of bounded degree ⋮ Some variations on a theme of Irina Mel'nichuk concerning the avoidability of patterns in strings of symbols ⋮ 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 ⋮ Nonrepetitive list colorings of the integers ⋮ 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 ⋮ Repetitiveness of languages generated by morphisms ⋮ ON PANSIOT WORDS AVOIDING 3-REPETITIONS ⋮ 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
This page was built for publication: Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
