Least periods of k-automatic sequences

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.

[1]  Alan Cobham,et al.  Uniform tag sequences , 1972, Mathematical systems theory.

[2]  Jeffrey Shallit,et al.  Automatic Sequences: Theory, Applications, Generalizations , 2003 .

[3]  Jeffrey Shallit,et al.  Enumeration and Decidable Properties of Automatic Sequences , 2011, Developments in Language Theory.

[4]  Daniel Goc,et al.  Automatic Theorem-Proving in Combinatorics on Words , 2012, Int. J. Found. Comput. Sci..

[5]  James D. Currie,et al.  Least Periods of Factors of Infinite Words , 2009, RAIRO Theor. Informatics Appl..

[6]  Jeffrey Shallit,et al.  Periodicity, repetitions, and orbits of an automatic sequence , 2008, Theor. Comput. Sci..