Abstract
In this paper we pursue the study of the decidability of the dot-depth hierarchy. We give an effective lower bound for the dotdepth of an aperiodic monoid. The main tool for this is the study of a certain operation on varieties of finite monoids in terms of Mal'cev product. We also prove the equality of two decidable varieties which were known to contain all dot-depth two monoids. Finally, we restrict our attention to inverse monoids, and we prove that the class of inverse dot-depth two monoids is locally finite.
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.
