Finitely based monoids.
From MaRDI portal
Abstract: We present a method for proving that a semigroup is finitely based and find some new sufficient conditions under which a monoid is finitely based. As an application, we find a class of finite monoids where the finite basis property behaves in a complicated way with respect to the lattice operations but can be recognized by a simple algorithm. The method results in a short proof of the theorem of E. Lee that every monoid that satisfies xtxysy = xtyxsy and xytxsy = yxtxsy is finitely based. Also, the method gives an alternative proof of the theorem of F. Blanchet-Sadri that a pseudovariety of n-testable languages is finitely based if and only if n < 4.
The author provides a rather technical condition (Lemma 3.1) that can be used to prove that certain monoids are finitely based. She applies her condition to give alternative proofs of some results by \textit{E. W. H. Lee} [Mosc. Math. J. 12, No. 4, 787-802 (2012; Zbl 1295.20063)] and \textit{F. Blanchet-Sadri} [Semigroup Forum 47, No. 3, 305-317 (1993; Zbl 0814.20048)] and to investigate the finite basis problem for monoids satisfying the identities \(xyt_1xt_2y=yxt_1xt_2y\), \(xt_1yt_2xy=xt_1yt_2yx\).
Recommendations
- Non-finitely based monoids.
- Finitary monoids.
- Minimal non-finitely based monoids.
- Finitely based monoids obtained from non-finitely based semigroups.
- F-Monoids
- scientific article; zbMATH DE number 2187899
- scientific article; zbMATH DE number 988816
- scientific article; zbMATH DE number 1438385
- The finite basis problem for Kauffman monoids.
Cites work
- A general finite basis condition for systems of semigroup identities
- Bases for equational theories of semi-groups
- Equations and dot-depth one
- Equations and monoid varieties of dot-depth one and two
- Finitely based sets of 2-limited block-2-simple words
- FINITELY BASED WORDS
- Finitely based, finite sets of words
- Finitely generated limit varieties of aperiodic monoids with central idempotents.
- Finiteness properties of varieties and the restriction to finite algebras.
- scientific article; zbMATH DE number 4023572 (Why is no real title available?)
- scientific article; zbMATH DE number 3561239 (Why is no real title available?)
- Maximal Specht varieties of monoids.
- Non-finitely based monoids.
- On certain finitely based varieties of semigroups
- REFLEXIVE RELATIONS, EXTENSIVE TRANSFORMATIONS AND PIECEWISE TESTABLE LANGUAGES OF A GIVEN HEIGHT
- The finite basis problem for Kiselman monoids.
- The finite basis problem for words with at most two non-linear variables.
Cited in
(18)- Finitely based sets of 2-limited block-2-simple words
- scientific article; zbMATH DE number 1668759 (Why is no real title available?)
- Infinite partition monoids.
- The finite basis problem for words with at most two non-linear variables.
- Minimal non-finitely based monoids.
- The finite basis problem for the monoid of two-by-two upper triangular tropical matrices
- scientific article; zbMATH DE number 5149703 (Why is no real title available?)
- Lee monoids are nonfinitely based while the sets of their isoterms are finitely based
- Classification of limit varieties of \(\mathcal{J}\)-trivial monoids
- Finitely based monoids obtained from non-finitely based semigroups.
- Finite basis problem for Lee monoids with involution
- Finite basis problems for stalactic, taiga, sylvester and baxter monoids
- Representations and identities of hypoplactic monoids with involution
- Catalan monoids inherently nonfinitely based relative to finite \(\mathscr{R}\)-trivial semigroups
- Limit varieties generated by finite non-J-trivial aperiodic monoids
- Lattices of varieties of plactic-like monoids
- Non-finitely based monoids.
- The finite basis problem for Kiselman monoids.
This page was built for publication: Finitely based monoids.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744848)
