Abstract
We characterize the varieties of rational languages closed under products with counter. They are exactly the varieties that correspond via Eilenberg's theorem to the varieties of monoids closed under inverse LG sol-relational morphisms. This yields some decidability results for certain classes of rational languages.
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.
