Reference : Relations on words
Scientific journals : Article
Physical, chemical, mathematical & earth Sciences : Mathematics
Engineering, computing & technology : Computer science
http://hdl.handle.net/2268/203702
Relations on words
English
Rigo, Michel mailto [Université de Liège > Département de mathématique > Mathématiques discrètes >]
2017
Indagationes Mathematicae
Elsevier
28
183-204
Yes (verified by ORBi)
International
0019-3577
1872-6100
Amsterdam
The Netherlands
[en] Combinatorics on words ; growth function ; pattern avoidance ; abelian equivalence ; Parikh matrices
[en] 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, $k$-abelian equivalence, combinatorial coefficients and associated relations, Parikh matrices and $M$-equivalence. In particular, some new refinements of abelian equivalence are introduced.
Researchers
http://hdl.handle.net/2268/203702
10.1016/j.indag.2016.11.018

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
relationsOnWords-final.pdfAuthor preprint270.72 kBView/Open

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.