A1 Refereed original research article in a scientific journal

Ultimately constant abelian complexity of infinite words



Authors: Aleksi Saarela

Publication year: 2009

Journal:: Journal of Automata, Languages and Combinatorics

Journal name in source: J. Autom. Lang. Comb.

Volume: 14

Issue: 3-4

First page : 255

Last page: 258

Number of pages: 4


Abstract
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.


Research Areas

Downloadable publication

This is an electronic reprint of the original article.
This reprint may differ from the original in pagination and typographic detail. Please cite the original version.


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