Automata Theory Based on Quantum Logic II

摘要

We establish the pumping lemma in automata theory based on quantum logicunder certain conditions on implication, and discuss the recognizability by theproduct and union of orthomodular lattice-valued (quantum) automata. Inparticular, we show that the equivalence between the recognizabilty by the productof automata and the conjunction of the recognizabilities by the factor automatais equivalent to the distributivity of meet over union in the truth-value set.