Automata and grammars theory based on Unsharp quantum logic
Peng Jia-yin · Computer Engineering and Applications Journal · 2012
A fundamental framework of automata and grammar theory based on the two unsharp quantum structures,extended lattice ordered effect algebra and lattice ordered QMV algebra with a certain kind of distributive law,is preliminarily established in this paper.The concept of e-valued regular grammar is introduced.It is showed that any e-valued language recognized by e-valued automaton is equivalent to that generated by some e-valued regular grammar,the e-valued language generated by any e-valued regular grammar is also equivalent to that recognized by some e-valued automaton.The closure properties of e-valued language under the operations of sum,concatenation and reversal are respectively discussed.