论文信息 - Pumping Lemma for Quantum Automata

Pumping Lemma for Quantum Automata

Not all lattice-valued quantum automata possess the pumping property in its strict form. However the pumping lemma can be generalized, and all lattice-valued quantum automata possess the generalized pumping property.

Ruqian Lu | R. Lu | Hong Zheng | Hong Zheng

[1] James P. Crutchfield,et al. Quantum automata and quantum grammars , 2000, Theor. Comput. Sci..

[2] J. P. Rawling,et al. Orthologic and quantum logic: models and computational elements , 2000, JACM.

[3] Richard J. Greechie. A Non-Standard Quantum Logic with a Strong Set of States , 1981 .

[4] Hans Reichenbach,et al. Philosophic foundations of quantum mechanics , 1945 .

[5] Hans Reichenbach,et al. Philosophic Foundations of Quantum Mechanics. , 1946 .

[6] Qiu Dao. Automata and Grammars Theory Based on Quantum Logic , 2003 .

[7] George Gratzer,et al. Universal Algebra , 1979 .

[8] D. Deutsch. Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[9] Ruqian Lu,et al. Lattices of Quantum Automata , 2003 .

[10] Zdenka Riečanová. Subdirect Decompositions of Lattice Effect Algebras , 2003 .

[11] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[12] Mingsheng Ying,et al. Automata Theory Based on Quantum Logic II , 2000 .