Finite automata based on quantum logic and monadic second-order quantum logic

Science in China, Series F: Information Sciences

Volumn 53, Issue 1, 2010, Pages 101-114

  Li, YongMing ^a  

^a SHAANXI NORMAL UNIVERSITY   (China)

Author keywords

Finite automaton; Kleene theorem; Monadic second quantum logic; Quantum computation; Quantum language; Quantum logic

Indexed keywords

EID: 76149131344     PISSN: 10092757     EISSN: 18622836     Source Type: Journal    
DOI: 10.1007/s11432-010-0003-2     Document Type: Article

References (21)

1. Hopcroft J E, Ullman J D. Introduction to Automata Theory, Languages and Computation. New York: Addison-Wesley, 1979.
2. Büchi J R. Weak second-order arithmetic and finite automata. Zeitschrifit für Mathematische Logik and Grundlagen der Mathematik, 1960, 6: 66-92.
3. Elgot C C. Decision problems of finite automata design and related arithmetics. Trans Am Math Society, 1961, 98: 21-52.
4. Schützenberger M O. On finite monoids having only trivial subgroups. Inf Control, 1965, 8: 190-194.
5. McNaughton R, Papert S. Counter-Free Automata. Cambridge: MIT Press, 1971.
6. Eilengerb S. Automata, Languages and Machines, vol. A, vol B. New York: Academic Press, 1974.
7. Droste M, Gastin P. Weighted automata and weighted logics. Theor Comput Sci, 2007, 380: 69-86.
8. Mcmillan K. Symbolic Model Checking. Dordrecht: Kluwer Academic Publisher, 1993.
9. Nielsen M A, Chuang I L. Quantum Computation and Quantum Information. Cambridge: Cambridge University, 2000.
10. Ying M S. Automata theory based on quantum logic (I). Int J Theor Phys, 2000, 39: 981-991.
11. Ying M S. Automata theory based on quantum logic (II). Int J Theor Phys, 2000, 39: 2545-2557.
12. Ying M S. A theory of computation based on quantum logic (I). Theor Comput Sci, 2005, 344: 134-207.
13. Qiu D W. Automata theory based on quantum logic: reversibilities and pushdown automata. Theor Comput Sci, 2007, 386: 38-56.
14. Qiu D W. Notes on automata theory based on quantum logic. Sci China Ser F-Inf Sci, 2007, 50: 154-169.
15. Kalmbach G. Orthomodular Lattices. London: Academic Press, 1983.
16. Li Y M, Li Z H. Free semilattices and strongly free semilattices generated by partially ordered sets. Northeast Math J, 1993, 9: 359-366.
17. Rabin M, Scott D. Finite automata and their decision problems. IBM J Research Develop, 1959, 3: 114-125.
18. 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.
19. Li Y M. Approximation and universality of fuzzy Turing machines. Sci China Ser F-Inf Sci, 2008, 51: 1445-1465.
20. Khoussainov B, Nerode A. Automata Theory and its Applications. Boston: Birkäuser, 2001.
21. Thomas W. Languages, automata and logic. In: Rozenberg G, Salomaa A, eds. Handbook of Formal Languages, vol. 3. Berlin: Springer-Verlag, 1997. 389-485.