Abstract
We investigate questions related to the presence of primitive words and Lyndon words in automatic and linearly recurrent 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. Finally, we show that the number of Lyndon factors of a linearly recurrent sequence is bounded. © 2013 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Goč, D., Saari, K., & Shallit, J. (2013). Primitive words and lyndon words in automatic and linearly recurrent sequences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7810 LNCS, pp. 311–322). Springer Verlag. https://doi.org/10.1007/978-3-642-37064-9_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
