A generalization of repetition threshold
From MaRDI portal
Publication:2575754
DOI10.1016/j.tcs.2005.07.016zbMath1079.68082arXivmath/0310144OpenAlexW1999696434MaRDI QIDQ2575754
Pascal Ochem, Lucian Ilie, Jeffrey O. Shallit
Publication date: 6 December 2005
Published in: Theoretical Computer Science, Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0310144
Related Items
A proof of Dejean’s conjecture ⋮ Letter frequency in infinite repetition-free words ⋮ Avoidability of formulas with two variables ⋮ Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture ⋮ Doubled patterns with reversal and square-free doubled patterns ⋮ Avoiding or Limiting Regularities in Words ⋮ Fewest repetitions versus maximal-exponent powers in infinite binary words ⋮ On Dejean's conjecture over large alphabets ⋮ Avoiding conjugacy classes on the 5-letter alphabet ⋮ Bounds for the generalized repetition threshold ⋮ Dejean's conjecture holds for \(n\geq 30\) ⋮ On a word avoiding near repeats ⋮ ON THE REPETITIVITY INDEX OF INFINITE WORDS ⋮ Dejean's conjecture holds for N ≥ 27 ⋮ A generator of morphisms for infinite words ⋮ A generalization of repetition threshold
Cites Work
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Infinite 0-1 sequences without long adjacent identical blocks
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- On repetitions of blocks in binary sequences
- How many squares must a binary sequence contain?
- On nonrepetitive sequences
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
