Back to Search
Start Over
Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences
- Publication Year :
- 2012
- Publisher :
- arXiv, 2012.
-
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.
Details
- Database :
- OpenAIRE
- Accession number :
- edsair.doi.dedup.....f6072a419ec2e0b4e6112f9e97326295
- Full Text :
- https://doi.org/10.48550/arxiv.1207.5124