The abelian complexity of the paperfolding word

DOI10.1016/j.disc.2013.01.005zbMath1260.05002arXiv1208.2856OpenAlexW2962792653MaRDI QIDQ1942045

Narad Rampersad, Blake W. Madill

Publication date: 15 March 2013

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.2856

zbMATH Keywords

abelian complexity\(k\)-regular sequencepaperfolding word

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (23)

Symmetry groups of infinite words ⋮ Computing abelian complexity of binary uniform morphic words ⋮ Cyclic Complexity of Words ⋮ The abelian complexity of infinite words and the Frobenius problem ⋮ On the abelian complexity of the Rudin-Shapiro sequence ⋮ On the abelian complexity of generalized Thue-Morse sequences ⋮ On the \(k\)-abelian complexity of the Cantor sequence ⋮ 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 ⋮ Abelian properties of Parry words ⋮ On the boundary sequence of an automatic sequence ⋮ On the additive complexity of a Thue-Morse-like sequence ⋮ Abelian closures of infinite binary words ⋮ On the 2-abelian complexity of the Thue-Morse word ⋮ Relations on words ⋮ Abelian antipowers in infinite words ⋮ A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences ⋮ On infinite prefix normal words ⋮ Aperiodic two-dimensional words of small abelian complexity ⋮ On the 2-abelian complexity of generalized Cantor sequences ⋮ Sequences of symmetry groups of infinite words ⋮ Output sum of transducers: limiting distribution and periodic fluctuation

This page was built for publication: The abelian complexity of the paperfolding word