Abelian Complexity of Morphic Words

Francine Blanchet-Sadri, Daniel Seita, and David Wise

We analyze patterns for quickly computing the exact abelian complexities of morphic words. We mostly consider uniform binary morphisms.

Keywords: Abelian complexity; Morphisms; Morphic words.

Acknowledgement: This material is based upon work supported by the National Science Foundation under Grant No. DMS-1060775.
Disclaimer: Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation.