Ultimately constant abelian complexity of infinite words



: Aleksi Saarela

: 2009

Journal of Automata, Languages and Combinatorics

J. Autom. Lang. Comb.

: 14

: 3-4

: 255

: 258

: 4


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.

Last updated on 2025-14-10 at 10:14