Relations on words (Q505060)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6676135
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Relations on words |
scientific article; zbMATH DE number 6676135 |
Statements
Relations on words (English)
0 references
18 January 2017
0 references
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.
0 references
combinatorics on words
0 references
growth function of a language
0 references
complexity function of an infinite word
0 references
pattern avoidance
0 references
periodicity
0 references
uniform recurrence
0 references
abelian equivalence
0 references
\(k\)-abelian equivalence
0 references
combinatorial coefficients
0 references
associated relations
0 references
Parikh matrices
0 references
\(M\)-equivalence
0 references
0 references
0 references
0 references
0 references
0.7450029253959656
0 references
0.7388654351234436
0 references
0.7347586154937744
0 references
0.7288988828659058
0 references
0.7280706763267517
0 references
