On the 2-abelian complexity of the Thue-Morse word

DOI10.1016/J.TCS.2015.05.047zbMath1330.68234arXiv1404.3906OpenAlexW1538675346MaRDI QIDQ501000

Florian Greinecker

Publication date: 8 October 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

Thue-Morse word2-abelian complexity2-regular sequencecomplexity of infinite words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (8)

On Growth and Fluctuation of k-Abelian Complexity ⋮ On growth and fluctuation of \(k\)-abelian complexity ⋮ On the \(k\)-abelian complexity of the Cantor sequence ⋮ Relations on words ⋮ Counting the number of non-zero coefficients in rows of generalized Pascal triangles ⋮ A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences ⋮ Computing the \(k\)-binomial complexity of the Thue-Morse word ⋮ On the 2-abelian complexity of generalized Cantor sequences

Cites Work

• Unnamed Item
• Unnamed Item
• On a generalization of abelian equivalence and complexity of infinite words
• The ring of \(k\)-regular sequences
• The ring of \(k\)-regular sequences. II.
• Enumeration of factors in the Thue-Morse word
• The abelian complexity of the paperfolding word
• A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences
• Automatic Sequences

This page was built for publication: On the 2-abelian complexity of the Thue-Morse word