Fewest repetitions in infinite binary words

DOI10.1051/ita/2011109zbMath1247.68201arXiv1207.5723OpenAlexW2119765531WikidataQ61677869 ScholiaQ61677869MaRDI QIDQ2911423

Maxime Crochemore, Golnaz Badkobeh

Publication date: 31 August 2012

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1207.5723

zbMATH Keywords

repetitionscombinatorics on wordsword morphisms

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

Infinite words containing the minimal number of repetitions ⋮ Avoiding or Limiting Regularities in Words ⋮ Fewest repetitions versus maximal-exponent powers in infinite binary words ⋮ The simplest binary word with only three squares

Cites Work

• Unnamed Item
• Unnamed Item
• Last cases of Dejean's conjecture
• Avoiding large squares in infinite binary words
• Polynomial versus exponential growth in repetition-free binary words
• How many squares must a binary sequence contain?
• Sur un théorème de Thue
• SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS
• A proof of Dejean’s conjecture