Fuzzy omega-automata

In this paper we introduce the notion of Fuzzy omega-Automata as an accepti ng device for Fuzzy omega-languages. We define Fuzzy omega-Finite State Aut omata which accept Fuzzy omega-regular languages with different acceptance criteria. We also define Distributed Fuzzy omega-Finite State Automata whic h are a group of fuzzy omega-finite state automata working in unison to acc ept a language with different modes of acceptance like the t-mode, *-mode, = k-mode, less than or equal to k-mode and greater than or equal to k-mode. We prove that Distributed Fuzzy omega-Finite State Automata accept the sam e set of languages as Fuzzy omega-Finite State Automata. Analogously we def ine Fuzzy omega-Pushdown Automata and Distributed Fuzzy omega-Pushdown Auto mata along with the different acceptance criteria and modes of acceptance f or the distributed case. The class of languages accepted by Fuzzy omega-Pus hdown Automata is fuzzy CFLomega while the class of languages accepted by D istributed Fuzzy omega-Pushdown Automata contains CFLomega. We give proofs to show that all modes of acceptance are equal in the case of Distributed F uzzy omega-Pushdown Automata. We also define L-Fuzzy omega-Automata and giv e some examples to show how it can be used to accept some non-fuzzy languag es which are not accepted by their classical counterparts. (C) 2001 Elsevie r Science Inc. All rights reserved.