Abstract

The purpose of the present work is to provide a simpler solution of a well-known characterization of fuzzy regular languages and a minimal realization for given fuzzy language by using Brzozowski’s algorithm. In between, we associate two crisp deterministic fuzzy automata with a given crisp deterministic fuzzy automaton and show that the reachability and observability maps of the given crisp deterministic fuzzy automaton turn out to be morphisms of category of all crisp deterministic fuzzy

Full Text
Paper version not known

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 call

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.