On the D0L Repetition Threshold
From MaRDI portal
Publication:3060199
DOI10.1051/ITA/2010015zbMATH Open1213.68478OpenAlexW2058869152MaRDI QIDQ3060199FDOQ3060199
Authors: Ilya Goldstein 
Publication date: 1 December 2010
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/44622
Recommendations
- The undirected repetition threshold
- A generalization of repetition threshold
- A generalization of repetition threshold
- Bounds for the generalized repetition threshold
- On Abelian repetition threshold
- Abelian repetition threshold revisited
- The repetition threshold for binary rich words
- On the Repetition Threshold for Large Alphabets
- Towards a definitive measure of repetitiveness
Cites Work
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Complexity and special factors
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- Dejean's conjecture holds for \(n\geq 30\)
- Sur un théorème de Thue
- A proof of Dejean’s conjecture
- Dejean's conjecture holds for N ≥ 27
- Dejean's conjecture and Sturmian words
- Reconnaissabilité des substitutions et complexité des suites automatiques
- On stabilizers of infinite words
- Multidimensional unrepetitive configurations
- Title not available (Why is that?)
- Arithmetical complexity of symmetric D0L words.
- On the size of the alphabet and the subword complexity of square-free DOL languages
- On the subword complexity of square-free DOL languages
- On the subword complexity of m-free DOL languages
- On the subword complexity of DOL languages with a constant distribution
- Asymptotic subword complexity of fixed points of group substitutions
- On the subword complexity of locally catenative DOL languages
- Automata calculating the complexity of automatic sequences
- On the Repetition Threshold for Large Alphabets
Cited In (4)
This page was built for publication: On the D0L Repetition Threshold
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3060199)
