On the D0L Repetition Threshold

DOI10.1051/ita/2010015zbMath1213.68478OpenAlexW2058869152MaRDI QIDQ3060199

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

zbMATH Keywords

finite wordsinfinite words over alphabets of various sizes

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Unnamed Item
• On the subword complexity of m-free DOL languages
• A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
• On the subword complexity of DOL languages with a constant distribution
• Dejean's conjecture and Sturmian words
• On stabilizers of infinite words
• Asymptotic subword complexity of fixed points of group substitutions
• On the size of the alphabet and the subword complexity of square-free DOL languages
• Multidimensional unrepetitive configurations
• On the subword complexity of square-free DOL languages
• On the subword complexity of locally catenative DOL languages
• Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
• Complexity and special factors
• Automata calculating the complexity of automatic sequences
• Arithmetical complexity of symmetric D0L words.
• 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
• Reconnaissabilité des substitutions et complexité des suites automatiques
• On the Repetition Threshold for Large Alphabets

This page was built for publication: On the D0L Repetition Threshold