Finitely based, finite sets of words
For a finite set \(W\) of words, \(S(W)\) stands for the monoid defined on the set consisting of all subwords of words in \(W\) and of \(0\) by letting the product of two subwords \(u\) and \(v\) be \(uv\) if \(uv\) is again a subword of a word in \(W\) and be \(0\) otherwise. This construction was suggested by \textit{P.~Perkins} [J. Algebra 11, 298-314 (1969; Zbl 0186.03401)], who used it to produce one of the first examples of a non-finitely based finite semigroup. The authors systematically study the finite basis problem for monoids of the form \(S(W)\). They find many interesting results showing that, in a sense, this class of monoids behaves with respect to the finite basis property as irregularly as the class of all finite semigroups. For example, with every finite set \(W\), one can start an infinite increasing sequence \(W=W_1\subset W_2\subset\dots\) of finite sets of words such that in the sequence \(S(W_k)\), \(k=1,2,\dots\), finitely and non-finitely based monoids alternate. One more example: there are finite sets \(V_1,V_2\) such that the monoids \(S(V_1)\) and \(S(V_2)\) are non-finitely based [finitely based], while their direct product \(S(V_1)\times S(V_2)\) is finitely based [respectively, non-finitely based].
- Non-finitely based monoids.
- Finitely based monoids obtained from non-finitely based semigroups.
- FINITELY BASED WORDS
- Classification of finitely based words in a class of words over a 3-letter alphabet.
- Catalan monoids inherently nonfinitely based relative to finite \(\mathscr{R}\)-trivial semigroups
- Lee monoid \(L_4^1\) is non-finitely based
- The identities of the free product of two trivial semigroups
- Unary enhancements of inherently non-finitely based semigroups.
- A class of finite semigroups without irredundant bases of identities.
- The finite basis problem for finite semigroups
- ALGORITHMIC PROBLEMS IN VARIETIES
- Bases for equational theories of semi-groups
- Basic questions for general algebras
- INHERENTLY NONFINITELY BASED FINITE SEMIGROUPS
- On cross semigroup varieties and related questions
- PROBLEMS OF BURNSIDE TYPE AND THE FINITE BASIS PROPERTY IN VARIETIES OF SEMIGROUPS
- TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
- Finite semigroups whose varieties have uncountably many subvarieties
- Varieties generated by unstable involution semigroups with continuum many subvarieties
- On the finite basis problem for certain 2-limited words.
- Almost cross varieties of aperiodic monoids with central idempotents.
- Finitely based sets of 2-limited block-2-simple words
- Standard elements of the lattice of monoid varieties
- Limit varieties of \(J\)-trivial monoids
- Nonfinitely based ai-semirings with finitely based semigroup reducts
- On the ascending and descending chain conditions in the lattice of monoid varieties
- Varieties of aperiodic monoids with central idempotents whose subvariety lattice is distributive
- The finite basis problem for words with at most two non-linear variables.
- Chain varieties of monoids
- Monoid varieties with extreme properties
- Lee monoids are nonfinitely based while the sets of their isoterms are finitely based
- FINITELY BASED WORDS
- Inherently non-finitely generated varieties of aperiodic monoids with central idempotents.
- Classification of limit varieties of \(\mathcal{J}\)-trivial monoids
- Varieties of monoids with complex lattices of subvarieties
- Limit varieties of aperiodic monoids with commuting idempotents
- Non-finitely based finite involution semigroups with finitely based semigroup reducts
- Finitely based monoids obtained from non-finitely based semigroups.
- The Division Relation: Congruence Conditions and Axiomatisability
- Machines, Computations, and Universality
- Catalan monoids inherently nonfinitely based relative to finite \(\mathscr{R}\)-trivial semigroups
- Limit varieties generated by finite non-J-trivial aperiodic monoids
- Minimal monoids generating varieties with complex subvariety lattices
- Cross varieties of aperiodic monoids with central idempotents.
- Finitely and non-finitely related words
- The Rees quotient monoid \(M(abba)\) generates a variety with uncountably many subvarieties
- Non-finitely related and finitely related monoids
- Small monoids generating varieties with uncountably many subvarieties
- Non-finitely based monoids.
- Finitely based monoids.
- Classification of finitely based words in a class of words over a 3-letter alphabet.
This page was built for publication: Finitely based, finite sets of words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2709973)
