The abelian complexity of the paperfolding word
From MaRDI portal
(Redirected from Publication:1942045)
Abstract: We show that the abelian complexity function of the ordinary paperfolding word is a 2-regular sequence.
Cited in
(24)- On the k-abelian complexity of the Cantor sequence
- On the additive complexity of a Thue-Morse-like sequence
- Abelian antipowers in infinite words
- On the 2-abelian complexity of generalized Cantor sequences
- Sequences of symmetry groups of infinite words
- On the boundary sequence of an automatic sequence
- Abelian closures of infinite binary words
- A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences
- Aperiodic two-dimensional words of small abelian complexity
- Output sum of transducers: limiting distribution and periodic fluctuation
- On the abelian complexity of the Rudin-Shapiro sequence
- On the abelian complexity of generalized Thue-Morse sequences
- Computing abelian complexity of binary uniform morphic words
- Cyclic Complexity of Words
- Abelian properties of Parry words
- The abelian complexity of infinite words and the Frobenius problem
- On the 2-abelian complexity of the Thue-Morse word
- Relations on words
- On infinite prefix normal words
- Abelian combinatorics on words: a survey
- Minimal Complexities for Infinite Words Written with d Letters
- On the 2-binomial complexity of the generalized Thue-Morse words
- Reduced complexities for sequences over finite alphabets
- Symmetry groups of infinite words
This page was built for publication: The abelian complexity of the paperfolding word
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1942045)
