Research On Characterizations And Products Of Two Kinds Of Nonclassical Finite Automata

This thesis is concerned with products of Mealy-type fuzzy fi-nite automata, and recognizability and accessibility of finite automata based onquantum logic. This thesis is divided into four chapters. It is organized as follows:In Chapter 1, we introduce some marks and basic definitions.In Chapter 2, we introduce several ways of constructing products for Mealy-type fuzzy finite automata as well as the concept of covering. The propertiesof transition functions and output functions are discussed. Furthermore, we in-vestigate the covering properties and mutual relationship with regard to theseproducts. We also prove that the covering relationship holds in the product offactor automata.In Chapter 3, inspired by classical automata theory and automata theorybased on quantum logic, we introduce the concepts of reversal, accessible, coac-cessible and complete part of finite state automata based on quantum logic. Someproperties of them are discussed. More importantly we investigate the recogniz-ability and accessibility properties of these types on the framework of quantumlogic by employing the approach of semantic analysis.In Chapter 4, we conclude this thesis and list some problems which areneeded to solve. These problems are much more interesting and important workto be done in the future.