Finitely based monoids.

DOI10.1007/S00233-015-9709-1zbMATH Open1348.20064OpenAlexW2092619689MaRDI QIDQ744848FDOQ744848

Authors Olga Sapir

Publication date 12 October 2015

Published in Semigroup Forum (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1402.5136

zbMATH Keywords

bases of identitiesfinite basis problemfinitely based monoidssemigroup identitiessemigroup varieties

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Varieties and pseudovarieties of semigroups (20M07)

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.

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

• scientific article; zbMATH DE number 4023572 (Why is no real title available?)
• scientific article; zbMATH DE number 3561239 (Why is no real title available?)
• 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 WORDS
• Finitely based sets of 2-limited block-2-simple 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.
• 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)

• The finite basis problem for Kiselman monoids.
• Finitely based sets of 2-limited block-2-simple words
• Representations and identities of hypoplactic monoids with involution
• Infinite partition monoids.
• Limit varieties generated by finite non-J-trivial aperiodic monoids
• Finitely based monoids obtained from non-finitely based semigroups.
• Finite basis problems for stalactic, taiga, sylvester and baxter monoids
• Lee monoids are nonfinitely based while the sets of their isoterms are finitely based
• Lattices of varieties of plactic-like monoids
• scientific article; zbMATH DE number 5149703 (Why is no real title available?)
• The finite basis problem for words with at most two non-linear variables.
• scientific article; zbMATH DE number 1668759 (Why is no real title available?)
• Classification of limit varieties of \(\mathcal{J}\)-trivial monoids
• Finite basis problem for Lee monoids with involution
• Non-finitely based monoids.
• Catalan monoids inherently nonfinitely based relative to finite \(\mathscr{R}\)-trivial semigroups
• Minimal non-finitely based monoids.
• The finite basis problem for the monoid of two-by-two upper triangular tropical matrices

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)