Asymptotic Abelian Complexities of Certain Morphic Binary Words

Abstract

<p>We study asymptotic Abelian complexities of morphic binary words. We complete<br />the classification of upper Abelian complexities of pure morphic binary words initiated<br />recently by F. Blanchet-Sadri, N. Rampersad, and N. Fox. We also study a class of<br />morphic binary words having different asymptotic factor complexities despite having<br />the same asymptotic Abelian complexity.<br /></p>