Fewest repetitions in infinite binary words - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue RAIRO - Theoretical Informatics and Applications (RAIRO: ITA) Année : 2012

Fewest repetitions in infinite binary words

Résumé

A square is the concatenation of a nonempty word with itself. A word has period p if its letters at distance p 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, and 2 factors of exponent 7/3. These are the only factors of exponent larger than 2. The value 7/3 introduces what we call the finite-repetition threshold of the binary alphabet. We conjecture it is 7/4 for the ternary alphabet, like its repetitive threshold.
Fichier principal
Vignette du fichier
Fewest_repetitions_in_infinite_binary_words.pdf (153.39 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00742086 , version 1 (13-02-2013)

Identifiants

Citer

Golnaz Badkobeh, Maxime Crochemore. Fewest repetitions in infinite binary words. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2012, 46 (1), pp.17-31. ⟨10.1051/ita/2011109⟩. ⟨hal-00742086⟩
119 Consultations
224 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More