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.
['Aleksi Saarela']
Ultimately constant abelian complexity of infinite words