“…Two finite words u and v are called abelian equivalent if, for each letter a of the underlying alphabet Σ, the words u and v contain equally many occurrences of a. The notion has been studied in the relation of abelian complexity of infinite words [2,18,27,28], abelian repetitions and avoidance [3,4,14,23,26], other topics [9,21,22,25]; see also [24] and references therein.…”