Classification of finitely based words in a class of words over a \(3\)-letter alphabet. (Q896250)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Classification of finitely based words in a class of words over a \(3\)-letter alphabet. |
scientific article; zbMATH DE number 6518151
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Classification of finitely based words in a class of words over a \(3\)-letter alphabet. |
scientific article; zbMATH DE number 6518151 |
Statements
Classification of finitely based words in a class of words over a \(3\)-letter alphabet. (English)
0 references
9 December 2015
0 references
A finite set of words \(W\subseteq X^*\) over an alphabet \(X\) is finitely based if the syntactic monoid \(S(W)\) is finitely based, i.e. the identities it satisfies are finitely axiomatizable. A classification (30 cases) is established for finitely based words over the alphabet \(\{x,y,z\}\) without subwords of the form \(xz\), \(yx\) or \(zy\).
0 references
finitely based words
0 references
syntactic monoids
0 references
bases of identities
0 references
