arXiv:1703.04063 [math.CO]AbstractReferencesReviewsResources
On the $k$-abelian complexity of the Cantor sequence
Published 2017-03-12Version 1
In this paper, we prove that for every integer $k \geq 1$, the $k$-abelian complexity function of the Cantor sequence $\mathbf{c} = 101000101\cdots$ is a $3$-regular sequence.
Comments: 13 pages, 3 figures
Related articles: Most relevant | Search more
Abelian complexity function of the Tribonacci word
arXiv:1208.2856 [math.CO] (Published 2012-08-14)
The abelian complexity of the paperfolding word
arXiv:2012.04969 [math.CO] (Published 2020-12-09)
Regular sequences and synchronized sequences in abstract numeration systems