The abelian complexity of the paperfolding word
Abstract
We show that the abelian complexity function of the ordinary paperfolding word is a 2-regular sequence.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.