Investigation Of The Properties For Several Kinds Of Automata

This paper is concerned with the properties of several kinds of automata. In chapter one, some basic concepts are introduced. In chapter two, the definitions of indeterministic and deterministic initial Lattice-valued finite automata are given. Based on these definitions, we discuss the re-lations between them. And the equivalences of the several kinds of initial Lattice-valued finite automata are obtained. Moreover, the sufficient and necessary conditions for the equivalence between indeterministic and deter-ministic initial Lattice-valued finite automata are given. In chapter three, we study Mizumoto deterministic lattice finite automata(denote with Mizu-moto DFA) with membership values in lattice ordered monoids. And the stateswise equivalence relations and automata equivalence relations are given. We show that a Mizumoto DFA has an equivalent minimal Mizumoto DFA. From these equivalence relations, a minimization algorithm of the Mizumoto DFA is obtained. In chapter four, the definitions of fuzzy Moore automata's reversibility, accessibility and completion are given. Some related properties of them are discussed. What is more, some relationships amongst these prop-erties are obtained. And the minimization of fuzzy Moore automata is also investigated. At last, some significant results concerning of them are given systematically.