Bounds for the generalized repetition threshold

DOI10.1016/J.TCS.2010.10.009zbMath1232.68097OpenAlexW1987554801MaRDI QIDQ544880

Elise Vaslet, Pascal Ochem, Francesca Fiorenzi

Publication date: 16 June 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.10.009

zbMATH Keywords

Dejean's conjecturerepetition threshold

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (1)

Avoiding or Limiting Regularities in Words

Cites Work

• Last cases of Dejean's conjecture
• 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
• On Dejean's conjecture over large alphabets
• Sur un théorème de Thue
• A generalization of repetition threshold
• A proof of Dejean’s conjecture
• Dejean's conjecture holds for N ≥ 27

This page was built for publication: Bounds for the generalized repetition threshold