Back to Search
Start Over
Least periods of k-automatic sequences
- Publication Year :
- 2012
- Publisher :
- arXiv, 2012.
-
Abstract
- Currie and Saari initiated the study of least periods of infinite words, and they showed that every integer n >= 1 is a least period of the Thue-Morse sequence. We generalize this result to show that the characteristic sequence of least periods of a k-automatic sequence is (effectively) k-automatic. Through an implementation of our construction, we confirm the result of Currie and Saari, and we obtain similar results for the period-doubling sequence, the Rudin-Shapiro sequence, and the paperfolding sequence.
Details
- Database :
- OpenAIRE
- Accession number :
- edsair.doi.dedup.....c571be4a957d882702a74089fba557a2
- Full Text :
- https://doi.org/10.48550/arxiv.1207.5450