Abelian maximal pattern complexity of words
Combinatorics
2019-02-20 v1 Dynamical Systems
Abstract
In this paper we study the maximal pattern complexity of infinite words up to Abelian equivalence. We compute a lower bound for the Abelian maximal pattern complexity of infinite words which are both recurrent and aperiodic by projection. We show that in the case of binary words, the bound is actually achieved and gives a characterization of recurrent aperiodic words.
Cite
@article{arxiv.1301.5113,
title = {Abelian maximal pattern complexity of words},
author = {Teturo Kamae and Steven Widmer and Luca Q. Zamboni},
journal= {arXiv preprint arXiv:1301.5113},
year = {2019}
}