TY  - JOUR
AB  - We establish the pumping lemma in automata theory based on quantum logic under certain conditions on implication, and discuss the recognizability by the product and union of orthomodular lattice-valued (quantum) automata. In particular, we show that the equivalence between the recognizabilty by the product of automata and the conjunction of the recognizabilities by the factor automata is equivalent to the distributivity of meet over union in the truth-value set.
AU  - Ying, M
DA  - 2000/01/01
DO  - 10.1023/A:1026453524064
EP  - 2557
JO  - International Journal of Theoretical Physics
PY  - 2000/01/01
SP  - 2545
TI  - Automata theory based on quantum logic II
VL  - 39
Y1  - 2000/01/01
Y2  - 2026/05/30
ER  -