Abstract
We present a method for proving that a semigroup is finitely based (FB) and find some new sufficient conditions under which a monoid is FB. As an application, we find a class of finite aperiodic 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 $$xt_1xyt_2y \approx xt_1yxt_2y$$ and $$xyt_1xt_2y \approx yxt_1xt_2y$$ is FB. Also, the method gives an alternative proof of the theorem of F. Blanchet-Sadri that a pseudovariety of $$n$$ -testable languages is FB if and only if $$n \le 3$$ .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
