On growth and fluctuation of k-abelian complexity




Cassaigne J, Karhumaki J, Saarela A

PublisherACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD

2017

European Journal of Combinatorics

EUROPEAN JOURNAL OF COMBINATORICS

EUR J COMBIN

65

92

105

14

0195-6698

1095-9971

DOIhttps://doi.org/10.1016/j.ejc.2017.05.006

https://research.utu.fi/converis/portal/detail/Publication/26508045



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. (C) 2017 Elsevier Ltd. All rights reserved.

Last updated on 2024-26-11 at 22:58