On Dejean's conjecture over large alphabets
From MaRDI portal
Publication:2456366
DOI10.1016/j.tcs.2007.06.001zbMath1124.68087WikidataQ57253996 ScholiaQ57253996MaRDI QIDQ2456366
Publication date: 18 October 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.06.001
Related Items
The weak circular repetition threshold over large alphabets, Transition Property for $$\alpha $$-Power Free Languages with $$\alpha \ge 2$$ and $$k\ge 3$$ Letters, The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$, On the growth rates of complexity of threshold languages, The repetition threshold for binary rich words, Dejean's conjecture and letter frequency, Asymptotic repetitive threshold of balanced sequences, 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, Minimal critical exponent of quasiperiodic words, Growth properties of power-free languages, Bounds for the generalized repetition threshold, Last cases of Dejean's conjecture, On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters, Branching frequency and Markov entropy of repetition-free languages, Growth rates of complexity of power-free languages, On a word avoiding near repeats, A generalization of Thue freeness for partial words, Growth of power-free languages over large alphabets, On repetition thresholds of caterpillars and trees of bounded degree, Nonrepetitive list colorings of the integers, Abelian repetition threshold revisited, Fractional meanings of nonrepetitiveness, Extremal overlap-free and extremal \(\beta\)-free binary words, On the number of \(\alpha \)-power-free binary words for \(2<\alpha \leq 7/3\), Dejean's conjecture holds for \(n\geq 30\), Repetition avoidance in products of factors, Subword complexity and power avoidance, Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture, \((2+\epsilon )\)-nonrepetitive list colouring of paths, The undirected repetition threshold and undirected pattern avoidance, On minimal critical exponent of balanced sequences, ON PANSIOT WORDS AVOIDING 3-REPETITIONS, ON THE EXISTENCE OF MINIMAL β-POWERS, On Abelian repetition threshold, Highly nonrepetitive sequences: Winning strategies from the local lemma, A proof of Dejean’s conjecture, On extremal properties of the Fibonacci word, AVOIDING APPROXIMATE SQUARES, ON THE REPETITIVITY INDEX OF INFINITE WORDS, Dejean's conjecture holds for N ≥ 27
Cites Work
- Unnamed Item
- Unnamed Item
- Polynomial versus exponential growth in repetition-free binary words
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Dejean's conjecture and Sturmian words
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- Uniformly growing k-th power-free homomorphisms
- Sur un théorème de Thue
- A generalization of repetition threshold
- SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS
- MUTUALLY AVOIDING TERNARY WORDS OF SMALL EXPONENT
- On the Repetition Threshold for Large Alphabets
