The abelian complexity of the paperfolding word

作者：Madill Blake; Rampersad Narad^*

来源：Discrete Mathematics, 2013, 313(7): 831-838.

DOI：10.1016/j.disc.2013.01.005

• Abelian complexity
• Paperfolding word
• k-regular sequence

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

• 出版日期2013-4-6