Study On Classification Of Fuzzy Finite Automata And Statewise Minimization Algorithm Of Fuzzy Finite Automata

This paper is concerned with the classification of fuzzy finite automata and the minimization algorithm of fuzzy finite automata.In Chapter 1, fuzzy finite automata is classified to two kind of basic models: one is the fuzzy finite automaton with initial states and no outputs, the other is the fuzzy finite automaton with outputs and no initial states. Based on this classification, some important types of fuzzy finite automaton are classified. In the meantime, The relations among these fuzzy finite automata in same models are obtained. In Chapter 2, a class of fuzzy finite automata corresponding to the Mealy type of ordinary automata is formulated and two types of statewise equivalence relations are introduced. From the equivalence relations, a minimal form is defined and a minimization algorithm of the Mealy type of fuzzy finite automata is obtained. In Chapter 3, a fuzzy finite automata with a fuzzy initial state that was first considered by M. Mizumoto, J. Toyota and K. Tanaka in 1969 is introduced. Based on the Mizumoto type of fuzzy finite automata, a statewise equivalence relation is considered. From the equivalence relation, a minimal form is defined and a minimization algorithm of the Mizumoto type of fuzzy finite automata is obtained. In Chapter 4, Quantum automata are introduced. We compare and contrast quantum automata with fuzzy finite automata , obtain some elementary relations and leave a set of open questions.