Currently displaying 1 – 3 of 3

Showing per page

Order by Relevance | Title | Year of publication

Least periods of factors of infinite words

James D. CurrieKalle Saari — 2009

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

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.

Least Periods of Factors of Infinite Words

James D. CurrieKalle Saari — 2008

RAIRO - Theoretical Informatics and Applications

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.

Standard factors of Sturmian words

Gwénaël RichommeKalle SaariLuca Q. Zamboni — 2010

RAIRO - Theoretical Informatics and Applications

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.

Page 1

Download Results (CSV)