Algebraic Characterization of Pushdown Automata Based on Quantum Logic
Yongming Li · Computer Engineering and Science · 2008
Firstly,the notion of orthomodular lattice-valued pushdown automaton(abbr.L-VPDA)is introduced,we traverse some algebraic properties of these automata in detail and also establish the algebraic features of these automata,i.e.by using the means of quantum state construction.We prove the fact that an arbitrary L-VPDA can accept the same L-valued language by the final states and by one L-VPDA with the crisp transition relation and fuzzy final states.Secondly,we discuss the algebraic characterization of orthomodular lattice-valued context-free languages,and also deal with the closed properties of these L-valued languages under some regular operations in particular at the same time.