Abstract
Two words u and v are said to be k-abelian equivalent if, for each word x of length at most k, the number of occurrences of x as a factor of u is the same as for v. We study some combinatorial properties of k-abelian equivalence classes. Our starting point is a characterization of k-abelian equivalence by rewriting, so-called k-switching. We show that the set of lexicographically least representatives of equivalence classes is a regular language. From this we infer that the sequence of the numbers of equivalence classes is $$\mathbb {N}$$-rational. We also show that the set of words defining k-abelian singleton classes is regular.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have