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.

Full Text
Published version (Free)

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