Back to Search
Start Over
Subword Complexity and k-Synchronization
- Publication Year :
- 2012
- Publisher :
- arXiv, 2012.
-
Abstract
- We show that the subword complexity function p_x(n), which counts the number of distinct factors of length n of a sequence x, is k-synchronized in the sense of Carpi if x is k-automatic. As an application, we generalize recent results of Goldstein. We give analogous results for the number of distinct factors of length n that are primitive words or powers. In contrast, we show that the function that counts the number of unbordered factors of length n is not necessarily k-synchronized for k-automatic sequences.<br />Comment: Some new results and better exposition
Details
- Database :
- OpenAIRE
- Accession number :
- edsair.doi.dedup.....299198deb9ee5e732f0f3055ad4c5cd1
- Full Text :
- https://doi.org/10.48550/arxiv.1206.5352