2000 character limit reached
The abelian complexity of the paperfolding word (1208.2856v1)
Published 14 Aug 2012 in math.CO and cs.FL
Abstract: We show that the abelian complexity function of the ordinary paperfolding word is a 2-regular sequence.