Asymptotic Abelian Complexities of Certain Morphic Binary Words
: Markus A. Whiteland
Publisher: Institut für Informatik, Justus-Liebig-Universität Giessen
: 2019
: Journal of Automata, Languages and Combinatorics
: JALC
: 24
: 1
: 89
: 114
: 2567-3785
DOI: https://doi.org/10.25596/jalc-2019-089
: https://www.jalc.de/issues/2019/issue_24_1/jalc-2019-089-114.php
: https://research.utu.fi/converis/portal/detail/Publication/39844861
We study asymptotic Abelian complexities of morphic binary words. We complete
the classification of upper Abelian complexities of pure morphic binary words initiated
recently by F. Blanchet-Sadri, N. Rampersad, and N. Fox. We also study a class of
morphic binary words having different asymptotic factor complexities despite having
the same asymptotic Abelian complexity.
