A4 Vertaisarvioitu artikkeli konferenssijulkaisussa
On growth and fluctuation of k-abelian complexity
Tekijät: Julien Cassaigne, Juhani Karhumäki, Aleksi Saarela
Toimittaja: Lev D. Beklemishev, Daniil V. Musatov
Konferenssin vakiintunut nimi: International Computer Science Symposium in Russia
Julkaisuvuosi: 2015
Journal: Lecture Notes in Computer Science
Kokoomateoksen nimi: Computer Science -- Theory and Applications: 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings
Sarjan nimi: Lecture Notes in Computer Science
Vuosikerta: 9139
Aloitussivu: 109
Lopetussivu: 122
ISSN: 0302-9743
DOI: https://doi.org/10.1007/978-3-319-20297-6_8
Rinnakkaistallenteen osoite: https://research.utu.fi/converis/portal/detail/Publication/3114388
An extension of abelian complexity, so called k-abelian complexity, has been considered recently in a number of articles. This paper considers two particular aspects of this extension: First, how much the complexity can increase when moving from a level k to the next one. Second, how much the complexity of a given word can fluctuate. For both questions we give optimal solutions.
Ladattava julkaisu This is an electronic reprint of the original article. |  |
