Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.ejc.2017.05.006 | European Journal of Combinatorics |
Field | DocType | Volume |
Abelian group,Discrete mathematics,Computer science | Conference | 65 |
ISSN | Citations | PageRank |
0195-6698 | 2 | 0.43 |
References | Authors | |
13 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Julien Cassaigne | 1 | 282 | 40.80 |
| Juhani Karhumäki | 2 | 1115 | 152.77 |
| Aleksi Saarela | 3 | 78 | 14.67 |