The abelian complexity of the paperfolding word
We show that the abelian complexity function of the ordinary paperfolding word is a 2-regular sequence.
math.CO↗
arXiv subjects
Blake Madill
Publications and source records attributed to Blake Madill.
arXiv subjects
Publications and source records attributed to Blake Madill.
We show that the abelian complexity function of the ordinary paperfolding word is a 2-regular sequence.