A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
Ultimately constant abelian complexity of infinite words
Tekijät: Aleksi Saarela
Julkaisuvuosi: 2009
Lehti: Journal of Automata, Languages and Combinatorics
Tietokannassa oleva lehden nimi: J. Autom. Lang. Comb.
Vuosikerta: 14
Numero: 3-4
Aloitussivu: 255
Lopetussivu: 258
Sivujen määrä: 4
Tiivistelmä
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.
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.
Ladattava julkaisu This is an electronic reprint of the original article. |  |
Turun yliopiston Tutkimustietojärjestelmän portaali