Abstract
In this paper, the classes of fuzzy languages realized by probabilistic, max-product and maximin automata are examined. Simple characterizations of these classes are given which reduce to Nerode's Theorem in the deterministic case. Using these characterizations, various properties of these classes of fuzzy languages are derived, including closure properties under various types of operations.
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.
