arXiv:1208.2856 [math.CO]AbstractReferencesReviewsResources The abelian complexity of the paperfolding word Blake Madill, Narad Rampersad Published 2012-08-14Version 1 We show that the abelian complexity function of the ordinary paperfolding word is a 2-regular sequence. Comments: 14 pages Categories: math.CO, cs.FL Subjects: 68R15 Keywords: abelian complexity function, ordinary paperfolding word Related articles: Most relevant | Search more arXiv:1309.4810 [math.CO] (Published 2013-09-18, updated 2015-02-15) Abelian complexity function of the Tribonacci word Ondřej Turek arXiv:1703.04063 [math.CO] (Published 2017-03-12) On the $k$-abelian complexity of the Cantor sequence Jin Chen, Xiaotao Lü, Wen Wu arXiv:1406.1876 [math.CO] (Published 2014-06-07, updated 2014-06-12) Abelian properties of Parry words Ondřej Turek Links Abstract on arXiv.org View preprint PDF Download TeX source Export citation in BibTeX Save eprint metadata as JSON Toolbox Post your review for this article Attach supplementary resources Edit our extended metadata Share this article on social media FacebookGoogle+LinkedInRedditTwitterVK Scan the QR code for this page
![QR code for arXiv:1208.2856 [math.CO]](http://oss.arxitics.com/images/favicon.svg)