Finitely based monoids.

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

Authors: Olga Sapir 

Publication date: 12 October 2015

Published in: Semigroup Forum (Search for Journal in Brave)

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.

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

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
• scientific article; zbMATH DE number 1438385
• The finite basis problem for Kauffman monoids.

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)

Cites Work

• Finiteness properties of varieties and the restriction to finite algebras.
• Title not available (Why is that?)
• Finitely based sets of 2-limited block-2-simple words
• Bases for equational theories of semi-groups
• Finitely based, finite sets of words
• The finite basis problem for words with at most two non-linear variables.
• Title not available (Why is that?)
• FINITELY BASED WORDS
• Title not available (Why is that?)
• Non-finitely based monoids.
• On certain finitely based varieties of semigroups
• Equations and monoid varieties of dot-depth one and two
• Finitely generated limit varieties of aperiodic monoids with central idempotents.
• The finite basis problem for Kiselman monoids.
• REFLEXIVE RELATIONS, EXTENSIVE TRANSFORMATIONS AND PIECEWISE TESTABLE LANGUAGES OF A GIVEN HEIGHT
• Equations and dot-depth one
• A general finite basis condition for systems of semigroup identities

Cited In (14)

• THE FINITE BASIS PROBLEM FOR THE MONOID OF TWO-BY-TWO UPPER TRIANGULAR TROPICAL MATRICES
• Minimal non-finitely based monoids.
• Representations and identities of hypoplactic monoids with involution
• Lattices of varieties of plactic-like monoids
• Infinite partition monoids.
• Title not available (Why is that?)
• Finite basis problems for stalactic, taiga, sylvester and baxter monoids
• The finite basis problem for words with at most two non-linear variables.
• Classification of limit varieties of 𝒥-trivial monoids
• Limit varieties generated by finite non-J-trivial aperiodic monoids
• The finite basis problem for Kiselman monoids.
• Title not available (Why is that?)
• Finitely based sets of 2-limited block-2-simple words
• Catalan monoids inherently nonfinitely based relative to finite \(\mathscr{R}\)-trivial semigroups

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)