Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
433850 | Theoretical Computer Science | 2015 | 18 Pages |
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
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Florian Greinecker,