Fuzzy ?-automata ?
In this paper we introduce the notion of Fuzzy ?-Automata as an accepting device for Fuzzy ?-languages. We define Fuzzy ?-Finite State Automata which accept Fuzzy ?-regular languages with different acceptance criteria. We also define Distributed Fuzzy ?-Finite State Automata which are a group of fuzzy ?-finite state automata working in unison to accept a language with different modes of acceptance like the t-mode, *-mode, =k-mode, ?k-mode and ?k-mode. We prove that Distributed Fuzzy ?-Finite State Automata accept the same set of languages as Fuzzy ?-Finite State Automata. Analogously we define Fuzzy ?-Pushdown Automata and Distributed Fuzzy ?-Pushdown Automata along with the different acceptance criteria and modes of acceptance for the distributed case. The class of languages accepted by Fuzzy ?-Pushdown Automata is fuzzy CFL? while the class of languages accepted by Distributed Fuzzy ?-Pushdown Automata contains CFL?. We give proofs to show that all modes of acceptance are equal in the case of Distributed Fuzzy ?-Pushdown Automata. We also define L-Fuzzy ?-Automata and give some examples to show how it can be used to accept some non-fuzzy languages which are not accepted by their classical counterparts.
?-automata modes of acceptance fuzzy automata distributed automata