Article ID Journal Published Year Pages File Type
4647823 Discrete Mathematics 2013 8 Pages PDF
Abstract

We show that the abelian complexity function of the ordinary paperfolding word is a 2-regular sequence.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
The abelian complexity of the paperfolding word
Authors
, ,