Abstract
The purpose of the present work is to introduce and study the concept of minimal deterministic automaton with rough output which recognizes the given rough languages. Specifically, we use two concepts for such construction, one is based on Myhill-Nerode’s theory and the other is on the basis of derivatives of the given rough language. Lastly, we discuss monoid representations of the given rough 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.
