The abelian complexity of the paperfolding word
Combinatorics
2012-08-15 v1 Formal Languages and Automata Theory
Abstract
We show that the abelian complexity function of the ordinary paperfolding word is a 2-regular sequence.
Keywords
Cite
@article{arxiv.1208.2856,
title = {The abelian complexity of the paperfolding word},
author = {Blake Madill and Narad Rampersad},
journal= {arXiv preprint arXiv:1208.2856},
year = {2012}
}
Comments
14 pages