Abstract
The purpose of this work is to use the concepts of reachability and coreachability maps to provide a solution of a well-known characterization for [Formula: see text]-valued multiset regular languages. In between, we associate two deterministic [Formula: see text]-valued multiset automata with a given deterministic [Formula: see text]-valued multiset automaton (DLMA) and show that the reachability and coreachability maps of the given DLMA turn out to be morphisms in the category of deterministic [Formula: see text]-valued multiset automata.
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 callSimilar Papers
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.
