Minimal critical exponent of quasiperiodic words

DOI10.1016/j.tcs.2014.06.039zbMath1360.68660OpenAlexW2012680709MaRDI QIDQ401485

Gwenaël Richomme

Publication date: 27 August 2014

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

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

zbMATH Keywords

critical exponentquasiperiodicityinfinite wordsrepetitions

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Last cases of Dejean's conjecture
• Polynomial versus exponential growth in repetition-free binary words
• Efficient detection of quasiperiodicities in strings
• A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
• Quasiperiodic Sturmian words and morphisms
• Dejean's conjecture and Sturmian words
• Every real number greater than 1 is a critical exponent
• Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
• Normal forms of quasiperiodic strings
• Uniformly growing k-th power-free homomorphisms
• Dejean's conjecture holds for \(n\geq 30\)
• Quasiperiodic and Lyndon episturmian words
• On Dejean's conjecture over large alphabets
• Sur un théorème de Thue
• On Quasiperiodic Morphisms
• A proof of Dejean’s conjecture
• Dejean's conjecture holds for N ≥ 27