Classification of finitely based words in a class of words over a \(3\)-letter alphabet. (Q896250): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00233-015-9712-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2083957843 / rank | |||
Normal rank | |||
Revision as of 02:03, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Classification of finitely based words in a class of words over a \(3\)-letter alphabet. |
scientific article |
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
