Classification of finitely based words in a class of words over a \(3\)-letter alphabet. (Q896250)

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\).