Bounds for the generalized repetition threshold
From MaRDI portal
Publication:544880
DOI10.1016/J.TCS.2010.10.009zbMATH Open1232.68097OpenAlexW1987554801MaRDI QIDQ544880FDOQ544880
Authors: Francesca Fiorenzi, Pascal Ochem, Elise Vaslet 
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
Recommendations
Cites Work
- Uniformly growing k-th power-free homomorphisms
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- On Dejean's conjecture over large alphabets
- Sur un théorème de Thue
- A proof of Dejean’s conjecture
- Dejean's conjecture holds for N ≥ 27
- Last cases of Dejean's conjecture
- Dejean's conjecture and Sturmian words
- A generalization of repetition threshold
Cited In (10)
- On an efficient method for estimating the number of nonrepeating words
- On the D0L Repetition Threshold
- Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture
- Avoiding or limiting regularities in words
- On repetition thresholds of caterpillars and trees of bounded degree
- Antisquares and critical exponents
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Repetition avoidance in products of factors
- A generalization of repetition threshold
- On Abelian repetition threshold
This page was built for publication: Bounds for the generalized repetition threshold
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q544880)
