Ultimately Constant Abelian Complexity of Infinite Words
Aleksi Saarela · Journal of automata, languages and combinatorics · 2009
It is known that there are recurrent words with constant abelian complexity three, but not with constant complexity four. We prove that there are recurrent words with ultimately constant complexity $c$ for every $c$.