On the Power of One-Way Automata with Quantum and Classical States
暂无分享,去创建一个
Carlo Mereghetti | Beatrice Palano | Maria Paola Bianchi | M. Bianchi | C. Mereghetti | Beatrice Palano
[1] Marcel Paul Schützenberger,et al. On the Definition of a Family of Automata , 1961, Inf. Control..
[2] Arto Salomaa,et al. Automata-Theoretic Aspects of Formal Power Series , 1978, Texts and Monographs in Computer Science.
[3] Alex Brodsky,et al. Characterizations of 1-Way Quantum Finite Automata , 2002, SIAM J. Comput..
[4] Mark Mercer. Lower Bounds for Generalized Quantum Finite Automata , 2008, LATA.
[5] Alberto Bertoni,et al. Trace monoids with idempotent generators and measure-only quantum automata , 2010, Natural Computing.
[6] Alberto Bertoni,et al. Some formal tools for analyzing quantum automata , 2006, Theor. Comput. Sci..
[7] Alberto Bertoni,et al. Quantum Computing: 1-Way Quantum Automata , 2003, Developments in Language Theory.
[8] Beatrice Palano,et al. Behaviours of Unary Quantum Automata , 2010, Fundam. Informaticae.
[9] Arnold L. Rosenberg,et al. Theoretical Computer Science, Essays in Memory of Shimon Even , 2006, Essays in Memory of Shimon Even.
[10] Carlo Mereghetti,et al. Quantum finite automata with control language , 2006, RAIRO Theor. Informatics Appl..
[11] Shenggen Zheng,et al. Potential of Quantum Finite Automata with Exact Acceptance , 2014, Int. J. Found. Comput. Sci..
[12] Andris Ambainis,et al. Algebraic Results on Quantum Automata , 2005, Theory of Computing Systems.
[13] Ashwin Nayak,et al. Optimal lower bounds for quantum automata and random access codes , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[14] Carlo Mereghetti,et al. Quantum automata for some multiperiodic languages , 2007, Theor. Comput. Sci..
[15] Lihua Wu,et al. Characterizations of one-way general quantum finite automata , 2009, Theor. Comput. Sci..
[16] John Watrous,et al. On the power of quantum finite state automata , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[17] G. Shilov,et al. Linear Algebra , 1971 .
[18] Andris Ambainis,et al. Superiority of exact quantum automata for promise problems , 2011, Inf. Process. Lett..
[19] Maksim Kravtsev,et al. Probabilistic Reversible Automata and Quantum Automata , 2002, COCOON.
[20] Carlo Mereghetti,et al. Size lower bounds for quantum automata , 2014, Theor. Comput. Sci..
[21] Alberto Bertoni,et al. Small size quantum automata recognizing some regular languages , 2005, Theor. Comput. Sci..
[22] Carlo Mereghetti,et al. Complexity of Promise Problems on Classical and Quantum Automata , 2014, Computing with New Resources.
[23] James P. Crutchfield,et al. Quantum automata and quantum grammars , 2000, Theor. Comput. Sci..
[24] Daowen Qiu,et al. Lower bounds on the size of semi-quantum automata , 2015, ArXiv.
[25] Oded Goldreich,et al. On Promise Problems: A Survey , 2006, Essays in Memory of Shimon Even.
[26] Andris Ambainis,et al. Two-way finite automata with quantum and classical state , 1999, Theor. Comput. Sci..
[27] Mika Hirvensalo,et al. Quantum Automata with Open Time Evolution , 2010, Int. J. Nat. Comput. Res..
[28] Rusins Freivalds,et al. Computing with New Resources: Essays Dedicated to Jozef Gruska on the Occasion of His 80th Birthday , 2015 .
[29] Shenggen Zheng,et al. One-Way Finite Automata with Quantum and Classical States , 2011, Languages Alive.
[30] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .