The abelian complexity of the paperfolding word
arXiv:1208.2856
Abstract
We show that the abelian complexity function of the ordinary paperfolding word is a 2-regular sequence.
14 pages
arXiv:1208.2856
We show that the abelian complexity function of the ordinary paperfolding word is a 2-regular sequence.
14 pages