Automata Theory Based on Quantum Logic: Recognizability and Accessibility

Inspired by Ying’s work on automata theory based on quantum logic and classical automata theory, we introduce the concepts of reversal, accessible, coaccessible and complete part of finite state automata based on quantum logic. Some properties of them are discussed. More importantly we investigate the recognizability and accessibility properties of these types on the framework of quantum logic by employing the approach of semantic analysis. Foundation: supported by the National Natural Science Foundation of China (No. 10671030).