Primitive Words and Lyndon Words in Automatic Sequences
Daniel Goč, Jeffrey O. Shallit · arXiv (Cornell University) · 2012
We investigate questions related to the presence of primitive words and Lyndon words in automatic sequences. We show that the Lyndon factorization of a k-automatic sequence is itself k-automatic. We also show that the function counting the number of primitive factors (resp., Lyndon factors) of length n in a k-automatic sequence is k-regular.