Displaying similar documents to “Repetitions in the Fibonacci infinite word”

Decimations and sturmian words

Jacques Justin, Giuseppe Pirillo (1997)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

A remark on morphic sturmian words

J. Berstel, P. Séébold (1994)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

Standard factors of Sturmian words

Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

Among the various ways to construct a characteristic Sturmian word, one of the most used consists in defining an infinite sequence of prefixes that are standard. Nevertheless in any characteristic word , some standard words occur that are not prefixes of . We characterize all standard words occurring in any characteristic word (and so in any Sturmian word) using firstly morphisms, then standard prefixes and finally palindromes.

Least Periods of Factors of Infinite Words

James D. Currie, Kalle Saari (2008)

RAIRO - Theoretical Informatics and Applications

Similarity:

We show that any positive integer is the least period of a factor of the Thue-Morse word. We also characterize the set of least periods of factors of a Sturmian word. In particular, the corresponding set for the Fibonacci word is the set of Fibonacci numbers. As a by-product of our results, we give several new proofs and tightenings of well-known properties of Sturmian words.