English

On the $k$-abelian complexity of the Cantor sequence

Combinatorics 2017-03-14 v1 Formal Languages and Automata Theory Number Theory

Abstract

In this paper, we prove that for every integer k1k \geq 1, the kk-abelian complexity function of the Cantor sequence c=101000101\mathbf{c} = 101000101\cdots is a 33-regular sequence.

Cite

@article{arxiv.1703.04063,
  title  = {On the $k$-abelian complexity of the Cantor sequence},
  author = {Jin Chen and Xiaotao Lü and Wen Wu},
  journal= {arXiv preprint arXiv:1703.04063},
  year   = {2017}
}

Comments

13 pages, 3 figures

R2 v1 2026-06-22T18:43:19.532Z