Relations on words
Formal Languages and Automata Theory
2016-02-11 v1 Combinatorics
Abstract
In the first part of this survey, we present classical notions arising in combinatorics on words: growth function of a language, complexity function of an infinite word, pattern avoidance, periodicity and uniform recurrence. Our presentation tries to set up a unified framework with respect to a given binary relation. In the second part, we mainly focus on abelian equivalence, -abelian equivalence, combinatorial coefficients and associated relations, Parikh matrices and -equivalence. In particular, some new refinements of abelian equivalence are introduced.
Cite
@article{arxiv.1602.03364,
title = {Relations on words},
author = {Michel Rigo},
journal= {arXiv preprint arXiv:1602.03364},
year = {2016}
}