On the 2-Abelian Complexity of the Thue-Morse Word
Combinatorics
2015-06-03 v3
Abstract
We show that the 2-abelian complexity of the infinite Thue-Morse word is 2-regular, and other properties of the 2-abelian complexity, most notably that it is a concatenation of palindromes of increasing length. We also show sharp bounds for the length of unique extensions of factors of size n, occurring in the Thue-Morse word.
Keywords
Cite
@article{arxiv.1404.3906,
title = {On the 2-Abelian Complexity of the Thue-Morse Word},
author = {Florian Greinecker},
journal= {arXiv preprint arXiv:1404.3906},
year = {2015}
}