Abstract
We prove that the equality problem is decidable for rational subsets of the monogenic free inverse monoid F. It is also decidable whether or not a rational subset of F is recognizable. We prove that a submonoid of F is rational if and only if it is finitely generated. We also prove that the membership problem for rational subsets of a finite J-above monoid is decidable, covering the case of free inverse monoids.
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.
