On growth and fluctuation of k-abelian complexity
| dc.contributor.author | Julien Cassaigne | |
| dc.contributor.author | Juhani Karhumäki | |
| dc.contributor.author | Aleksi Saarela | |
| dc.contributor.organization | fi=matematiikka|en=Mathematics| | |
| dc.contributor.organization-code | 1.2.246.10.2458963.20.41687507875 | |
| dc.converis.publication-id | 3114388 | |
| dc.converis.url | https://research.utu.fi/converis/portal/Publication/3114388 | |
| dc.date.accessioned | 2022-10-27T11:51:38Z | |
| dc.date.available | 2022-10-27T11:51:38Z | |
| dc.description.abstract | <p> 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.</p> | |
| dc.format.pagerange | 109 | |
| dc.format.pagerange | 122 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.jour-issn | 0302-9743 | |
| dc.identifier.olddbid | 172351 | |
| dc.identifier.oldhandle | 10024/155445 | |
| dc.identifier.uri | https://www.utupub.fi/handle/11111/30136 | |
| dc.identifier.urn | URN:NBN:fi-fe2021042715061 | |
| dc.language.iso | en | |
| dc.okm.affiliatedauthor | Karhumäki, Juhani | |
| dc.okm.affiliatedauthor | Saarela, Aleksi | |
| dc.okm.discipline | 111 Mathematics | en_GB |
| dc.okm.discipline | 111 Matematiikka | fi_FI |
| dc.okm.internationalcopublication | international co-publication | |
| dc.okm.internationality | International publication | |
| dc.okm.type | A4 Conference Article | |
| dc.publisher.country | Germany | en_GB |
| dc.publisher.country | Saksa | fi_FI |
| dc.publisher.country-code | DE | |
| dc.relation.conference | International Computer Science Symposium in Russia | |
| dc.relation.doi | 10.1007/978-3-319-20297-6_8 | |
| dc.relation.ispartofjournal | Lecture Notes in Computer Science | |
| dc.relation.ispartofseries | Lecture Notes in Computer Science | |
| dc.relation.volume | 9139 | |
| dc.source.identifier | https://www.utupub.fi/handle/10024/155445 | |
| dc.title | On growth and fluctuation of k-abelian complexity | |
| dc.title.book | Computer Science -- Theory and Applications: 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings | |
| dc.year.issued | 2015 |
Tiedostot
1 - 1 / 1