On the D0L Repetition Threshold

DOI10.1051/ITA/2010015MaRDI QIDQ3060199zbMATH OpenOpenAlexFDO

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, https://semanticscholar.org/paper/93998a8646e8b0fc164f3c47e871a5d614210c40

zbMATH Keywords

finite wordsinfinite words over alphabets of various sizes

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• The undirected 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 proof of Dejean’s conjecture
• A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
• Arithmetical complexity of symmetric D0L words.
• Asymptotic subword complexity of fixed points of group substitutions
• Automata calculating the complexity of automatic sequences
• Complexity and special factors
• Dejean's conjecture and Sturmian words
• Dejean's conjecture holds for \(n\geq 30\)
• Dejean's conjecture holds for N ≥ 27
• scientific article; zbMATH DE number 1234887 (Why is no real title available?)
• Multidimensional unrepetitive configurations
• On stabilizers of infinite words
• On the Repetition Threshold for Large Alphabets
• On the size of the alphabet and the subword complexity of square-free DOL languages
• On the subword complexity of DOL languages with a constant distribution
• On the subword complexity of locally catenative DOL languages
• On the subword complexity of m-free DOL languages
• On the subword complexity of square-free DOL languages
• Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
• Reconnaissabilité des substitutions et complexité des suites automatiques
• Sur un théorème de Thue

Cited in

(5)

• On Pansiot words avoiding 3-repetitions
• Bounds for the generalized repetition threshold
• On the Repetition Threshold for Large Alphabets
• An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence
• Dejean's conjecture and Sturmian words

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)