Relations on words

详细信息    查看全文

• 作者：Michel Rigo ^{M.Rigo@ulg.ac.be}
• 刊名：Indagationes Mathematicae
• 出版年：2017
• 出版时间：February 2017
• 年：2017
• 卷：28
• 期：1
• 页码：183-204
• 全文大小：360 K
• 卷排序：28

文摘

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, kk-abelian equivalence, combinatorial coefficients and associated relations, Parikh matrices and MM-equivalence. In particular, some new refinements of abelian equivalence are introduced.