The finite basis problem for words with at most two non-linear variables

Abstract

Let A be an alphabet and W be a set of words in the free monoid A*. Let S(W) denote the Rees quotient over the ideal of A* consisting of all words that are not subwords of words in W. We call a set of words W finitely based if the monoid S(W) is finitely based. We find a simple algorithm that recognizes finitely based words among words with at most two non-linear variables. We also describe syntactically all hereditary finitely based monoids of the form S(W).

Published version

References in corpus (2)

• Finitely based monoids
• The finite basis problem for the monoid of 2 by 2 upper triangular tropical matrices

Cited by in corpus (2)

• Varieties of monoids with complex lattices of subvarieties
• Finitely based sets of 2-limited block-2-simple words