Abstract
Several observations concerning equations over monoids of finite sets of words are made. Monoids considered are the monoid of finite prefix codes, the monoid of all finite sets and the monoid of all finite multisets, as well as some others. As an application, some known decidability results in automata theory are extended. Finally, several open questions are raised.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.