Abstract
We introduce monadic second-order quantum logic and prove that the behaviors of finite automata based on quantum logic are precisely the quantum languages definable with sentences of our monadic second-order quantum logic. This generalizes Büchi’s and Elgot’s fundamental theorems to quantum logic setting. We also consider first-order quantum logic and show that star-free quantum languages and aperiodic quantum languages introduced here coincide with the first-order quantum definable ones. This generalizes Schützenberger’s fundamental theorems to quantum logic setting. The determinazation of finite automata based on quantum logic is studied by introducing the generalized subset construction method. Then the Kleene theorem in the frame of quantum logic is presented here.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Hopcroft J E, Ullman J D. Introduction to Automata Theory, Languages and Computation. New York: Addison-Wesley, 1979
Büchi J R. Weak second-order arithmetic and finite automata. Zeitschrifit für Mathematische Logik and Grundlagen der Mathematik, 1960, 6: 66–92
Elgot C C. Decision problems of finite automata design and related arithmetics. Trans Am Math Society, 1961, 98: 21–52
Schützenberger M O. On finite monoids having only trivial subgroups. Inf Control, 1965, 8: 190–194
McNaughton R, Papert S. Counter-Free Automata. Cambridge: MIT Press, 1971
Eilengerb S. Automata, Languages and Machines, vol. A, vol B. New York: Academic Press, 1974
Droste M, Gastin P. Weighted automata and weighted logics. Theor Comput Sci, 2007, 380: 69–86
Mcmillan K. Symbolic Model Checking. Dordrecht: Kluwer Academic Publisher, 1993
Nielsen M A, Chuang I L. Quantum Computation and Quantum Information. Cambridge: Cambridge University, 2000
Ying M S. Automata theory based on quantum logic (I). Int J Theor Phys, 2000, 39: 981–991
Ying M S. Automata theory based on quantum logic (II). Int J Theor Phys, 2000, 39: 2545–2557
Ying M S. A theory of computation based on quantum logic (I). Theor Comput Sci, 2005, 344: 134–207
Qiu D W. Automata theory based on quantum logic: reversibilities and pushdown automata. Theor Comput Sci, 2007, 386: 38–56
Qiu D W. Notes on automata theory based on quantum logic. Sci China Ser F-Inf Sci, 2007, 50: 154–169
Kalmbach G. Orthomodular Lattices. London: Academic Press, 1983
Li Y M, Li Z H. Free semilattices and strongly free semilattices generated by partially ordered sets. Northeast Math J, 1993, 9: 359–366
Rabin M, Scott D. Finite automata and their decision problems. IBM J Research Develop, 1959, 3: 114–125
Li Y M, Pedrycz W. Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids. Fuzzy Sets Syst, 2005, 156: 68–92
Li Y M. Approximation and universality of fuzzy Turing machines. Sci China Ser F-Inf Sci, 2008, 51: 1445–1465
Khoussainov B, Nerode A. Automata Theory and its Applications. Boston: Birkäuser, 2001
Thomas W. Languages, automata and logic. In: Rozenberg G, Salomaa A, eds. Handbook of Formal Languages, vol. 3. Berlin: Springer-Verlag, 1997. 389–485
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Li, Y. Finite automata based on quantum logic and monadic second-order quantum logic. Sci. China Ser. F-Inf. Sci. 53, 101–114 (2010). https://doi.org/10.1007/s11432-010-0003-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-010-0003-2