Relations on words (Q505060): Difference between revisions

The construction of a unified framework for various concepts in combinatorics on words is achieved in this paper. The first setup concerns the growth function of a language, the complexity function of an infinite word, pattern avoidance, periodicity and uniform recurrence, with respect to a given binary relation. The second setup concerns abelian equivalence, \(k\)-abelian equivalence, combinatorial coefficients and associated relations, Parikh matrices and \(M\)-equivalence, introducing refinements of abelian equivalence. It is clearly an excellent effort of enrichment of existing unified frameworks for quite a lot of notions in combinatorics on words, which should be extended.