On repeated factors in C∞ -words
Information Processing Letters
Handbook of formal languages, vol. 1
Abelian Squares are Avoidable on 4 Letters
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Automatic Sequences: Theory, Applications, Generalizations
Automatic Sequences: Theory, Applications, Generalizations
Local squares, periodicity and finite automata
Rainbow of computer science
Fine and wilf's theorem for k-abelian periods
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
On a generalization of Abelian equivalence and complexity of infinite words
Journal of Combinatorial Theory Series A
| Hi-index | 5.23 |
We consider a recently defined notion of k-abelian equivalence of words in connection with avoidability problems. This equivalence relation, for a fixed natural number k, takes into account the numbers of occurrences of the different factors of length k and the prefix and the suffix of length k-1. We search for the smallest alphabet in which k-abelian squares and cubes can be avoided, respectively. For 2-abelian squares this is four-as in the case of abelian words, while for 2-abelian cubes we have only strong evidence that the size is two-as it is in the case of words. However, we are able to prove this optimal value only for 8-abelian cubes.