Least Periods of Factors of Infinite Words
Authors:
Open Access
- 12 March 2008
- journal article
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 43 (1) , 165-178
Abstract
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.Keywords
This publication has 10 references indexed in Scilit:
- Dejean’s conjecture and Sturmian wordsEuropean Journal of Combinatorics, 2007
- Some characterizations of finite Sturmian wordsTheoretical Computer Science, 2006
- MINIMAL DUVAL EXTENSIONSInternational Journal of Foundations of Computer Science, 2004
- Some properties of the factors of Sturmian sequencesTheoretical Computer Science, 2003
- Powers in Sturmian sequencesEuropean Journal of Combinatorics, 2003
- A Note on a Conjecture of Duval and Sturmian WordsRAIRO - Theoretical Informatics and Applications, 2002
- On the Index of Sturmian Words1999
- Combinatorics on Words1997
- Combinatorics of Words1997
- Uniqueness theorems for periodic functionsProceedings of the American Mathematical Society, 1965