Fewest repetitions in infinite binary words
Golnaz Badkobeh, Maxime Crochemore (2012)
RAIRO - Theoretical Informatics and Applications
Similarity:
A square is the concatenation of a nonempty word with itself. A word has period if its letters at distance match. The exponent of a nonempty word is the quotient of its length over its smallest period. In this article we give a proof of the fact that there exists an infinite binary word which contains finitely many squares and simultaneously avoids words of exponent larger than 7/3. Our infinite word contains 12 squares, which is the smallest possible number of squares to get the property,...