On possible values of the group complexity function of infinite words

Maksim Launer, Svetlana Puzynina, Ekaterina Voloshinova

A classical notion of a factor complexity of an infinite word is defined as a function $p(n)$ counting, for each $n$, the number of distinct factors (or blocks of consecutive lette…