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.

Valid XHTML 1.0 Strict Valid CSS!