Abstract
To handle fuzzy uncertainty in system modeling, nondeterministic finite automata have been generalized into fuzzy automata. After a reexamination of the notions of fuzzy automata in the literature, we ascertain that the fundamental property—nondeterminism—in nondeterministic finite automata has not been well embodied in the generalization. In order to reflect nondeterminism in fuzzy automata, we introduce nondeterministic fuzzy automata with or without ϵ-moves and fuzzy languages recognized by them. Like nondeterministic finite automata, nondeterministic fuzzy automata provide a mathematical representation of nondeterministic dynamic fuzzy systems. Moreover, we show that (deterministic) fuzzy automata, nondeterministic fuzzy automata, and nondeterministic fuzzy automata with ϵ-moves are all equivalent in the sense that they recognize the same class of fuzzy languages, which is an extension of the well-known equivalence among finite automata, nondeterministic finite automata, and nondeterministic finite automata with ϵ-moves.
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.
