Hostname: page-component-5b777bbd6c-sbgtn Total loading time: 0 Render date: 2025-06-17T21:58:56.973Z Has data issue: false hasContentIssue false
  • English
  • Français

Automata theory based on unsharp quantum logic†

Published online by Cambridge University Press:  01 August 2009

YUN SHANG ,
XIAN LU  and
RUQIAN LU
YUN SHANG
Affiliation:
Institute of Mathematics, AMSS, Academia Sinica, Beijing 100190, P. R. China Email: shangyun602@163.com
XIAN LU
Affiliation:
Institute of Mathematics, AMSS, Academia Sinica, Beijing 100190, P. R. China Email: shangyun602@163.com
RUQIAN LU
Affiliation:
Institute of Mathematics, AMSS, Academia Sinica, Beijing 100190, P. R. China Email: shangyun602@163.com Shanghai Key Lab of Intelligent Information Processing, Fudan University CAS Key Lab of IIP, Institute of Computing Technology, CAS
Get access Rights & Permissions [Opens in a new window]

Abstract

By studying two unsharp quantum structures, namely extended lattice ordered effect algebras and lattice ordered QMV algebras, we obtain some characteristic theorems of MV algebras. We go on to discuss automata theory based on these two unsharp quantum structures. In particular, we prove that an extended lattice ordered effect algebra (or a lattice ordered QMV algebra) is an MV algebra if and only if a certain kind of distributive law holds for the sum operation. We introduce the notions of (quantum) finite automata based on these two unsharp quantum structures, and discuss closure properties of languages and the subset construction of automata. We show that the universal validity of some important properties (such as sum, concatenation and subset constructions) depend heavily on the above distributive law. These generalise results about automata theory based on sharp quantum logic.

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 19 , Issue 4 , August 2009 , pp. 737 - 756
Copyright
Copyright © Cambridge University Press 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Birkhoff, G. and von Neumann, J. (1936) The logic of quantum mechanics. Annals of Mathematics 379 823–843.CrossRefGoogle Scholar
Chang, C. C. (1958) Algebraic analysis of many valued logics. Transactions of the American Mathematical Society 88 (2)467–490.CrossRefGoogle Scholar
Chiara, M. D., Giuntini, R. and Greechie, R. (2004) Reasoning in quantum theory-sharp and unsharp quantum logic, Kluwer Academic Publishers.CrossRefGoogle Scholar
Di Nola, A. and Gerla, B. (2004) Algebras of lukasiewicz logic and their semiring reducts. In: Litvinov, G. L. and Maslov, V. P. (eds.) Proceedings of the Conference on Idempotent Mathematics and Mathematical Physics.CrossRefGoogle Scholar
Dvurečenskig, A. and Pulmannová, S. (2000) New Trends in Quantum Structures, Kluwer, Dordrecht; Ister Science, Bratislava.CrossRefGoogle Scholar
Foulis, D. J. and Bennett, M. K. (1994) Effect algebras and Unsharp Quantum Logics. Foundations of Physics 24 1331–1352.CrossRefGoogle Scholar
Gerla, B. (2003) Many-valued logic and semirings. Neural network worlds 5 467–480.Google Scholar
Gerla, B. (2004) Automata over MV algebras. In: Proceedings of the 34th international symposium on multiple-valued logic 49–54.CrossRefGoogle Scholar
Giuntini, R. and Greuling, H. (1989) Torward a Formal Language for Unsharp Properties. Foundations of Physics 19 931–945.CrossRefGoogle Scholar
Giuntini, R. (1996) Quantum MV algebras. Studia logica 56 393–417.CrossRefGoogle Scholar
Gudder, S. (1995) Total extensions of effect algebras. Foundations of Physics Letters 8 243–252.CrossRefGoogle Scholar
Hopcroft, J. E. and Ullman, J. D. (1979) Introduction to Automata Theory, Languages, and Computation, Addision-Wesley.Google Scholar
Husimi, K. (1937) Studies on the foundation of quantum mechanics. Proc. Phys. Math. Soc. Japan 19 766–789.Google Scholar
Kalmbach, G. (1983) Orthomodular lattices, Academic Press.Google Scholar
Kaplansky, I. (1955) Any orthocomplemented complete modular lattice is a continuous geometry. Annals of Mathematics 61 524–541.CrossRefGoogle Scholar
Kôpka, F. and Chovanec, F. (1994) D-posets. Mathematica Slovaca 44 21–34.Google Scholar
Ludwig, G. (1983) Foundations of Quantum Mechanics, Volume 1, Springer-Verlag.CrossRefGoogle Scholar
Mackey, G. W. (1963) Mathematical foundations of quantum mechanics, Benjamin, New York.Google Scholar
Qiu, D. W. (2003) Automata and grammars theory based on quantum logic. Journal of software 23–27.Google Scholar
Qiu, D. W. (2004) Automata theory based on quantum logic: Some characterizations. Information and Computation 179–195.CrossRefGoogle Scholar
Qiu, D. W. and Ying, M. S. (2004) Characterization of quantum automata. Theoretical computer science 479–489.CrossRefGoogle Scholar
Svozil, K. (1998) Quantum logic, Springer-Verlag.Google Scholar
Ying, M. S. (2000a) Automata theory based on quantum logic (I). International Journal of Theoretical Physics 39 981–991.Google Scholar
Ying, M. S. (2000b) Automata theory based on quantum logic (II). International Journal of Theoretical Physics 39 2545–2557.CrossRefGoogle Scholar
Ying, M. S. (2005) A theory of computation based on quantum logic (I). Theoretical Computer Science 344 (2–3)134–207.CrossRefGoogle Scholar