The abelian complexity of the paperfolding word
Blake Madill, Narad Rampersad
TL;DR
This paper demonstrates that the abelian complexity function of the paperfolding word is a 2-regular sequence, revealing a structured regularity in its combinatorial properties.
Contribution
It establishes that the abelian complexity of the paperfolding word is a 2-regular sequence, a novel characterization in combinatorics on words.
Findings
The abelian complexity function is 2-regular.
The paperfolding word exhibits structured combinatorial properties.
Abstract
We show that the abelian complexity function of the ordinary paperfolding word is a 2-regular sequence.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.