{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:47:44Z","timestamp":1725486464656},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540413486"},{"type":"electronic","value":"9783540444114"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44411-4_22","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T18:52:31Z","timestamp":1182192751000},"page":"336-346","source":"Crossref","is-referenced-by-count":10,"title":["Quantum Pushdown Automata"],"prefix":"10.1007","author":[{"given":"Marats","family":"Golovkins","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,1,22]]},"reference":[{"key":"22_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/3-540-47849-3_21","volume-title":"Quantum Finite Multitape Automata","author":"A. Ambainis","year":"1999","unstructured":"A. Ambainis, R. Bonner, R. Freivalds, M. Golovkins, M. Karpinski: Quantum Finite Multitape Automata. Lecture Notes in Computer Science, 1999, Vol. 1725, pp. 340\u2013348. 345"},{"key":"22_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48686-0_17","volume-title":"Probabilities to Accept Languages by Quantum Finite Automata","author":"A. Ambainis","year":"1999","unstructured":"A. Ambainis, R. Bonner, R. Freivalds, A. Kikusts: Probabilities to Accept Languages by Quantum Finite Automata. Lecture Notes in Computer Science, 1999, Vol. 1627, pp. 174\u2013183. 337"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"A. Ambainis, R. Freivalds: 1-Way Quantum Finite Automata: Strengths, Weaknesses and Generalizations. Proc. 39th FOCS, 1998, pp. 332\u2013341. 337","DOI":"10.1109\/SFCS.1998.743469"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1137\/S0097539796300921","volume":"26","author":"E. Bernstein","year":"1997","unstructured":"E. Bernstein, U. Vazirani: Quantum Complexity Theory. SIAM Journal on Computing, 26:1411\u20131473, 1997. 336, 340","journal-title":"SIAM Journal on Computing"},{"key":"22_CR5","unstructured":"A. Brodsky, N. Pippenger: Characterizations of 1-Way Quantum Finite Automata. http:\/\/xxx.lanl.gov\/abs\/quant-ph\/9903014 . 337"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"D. Deutsch: Quantum Theory, the Church-Turing principle and the Universal Quantum Computer. Proc. Royal Society London, A400, 1985. pp. 96\u2013117. 336","DOI":"10.1098\/rspa.1985.0070"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"C. D\u00fcrr, M. Santha: A Decision Procedure for Unitary Linear Quantum Cellular Automata. Proc. 37th FOCS, 1996, pp. 38\u201345. 337","DOI":"10.1109\/SFCS.1996.548462"},{"issue":"6\/7","key":"22_CR8","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/BF02650179","volume":"21","author":"R. Feynman","year":"1982","unstructured":"R. Feynman: Simulating Physics with Computers. International Journal of Theoretical Physics, 1982, vol. 21, No 6\/7, pp. 467\u2013488. 336","journal-title":"International Journal of Theoretical Physics"},{"key":"22_CR9","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Quantum Challenges","author":"J. Gruska","year":"1999","unstructured":"J. Gruska: Quantum Challenges. Lecture Notes in Computer Science, 1999, Vol. 1725, pp. 1\u201328. 336"},{"key":"22_CR10","unstructured":"E. Gurari: An Introduction to the Theory of Computation. Computer Science Press, 1989. 338, 344"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"A. Kondacs, J. Watrous: On The Power of Quantum Finite State Automata. In Proc. 38th FOCS, 1997, pp. 66\u201375. 336, 337, 343","DOI":"10.1109\/SFCS.1997.646094"},{"key":"22_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/3-540-47849-3_31","volume-title":"Quantum Finite One-Counter Automata","author":"M. Kravtsev","year":"1999","unstructured":"M. Kravtsev: Quantum Finite One-Counter Automata. Lecture Notes in Computer Science, 1999, Vol. 1725, pp. 431\u2013440. 344"},{"key":"22_CR13","unstructured":"C. Moore, J. P. Crutchfield: Quantum Automata and Quantum Grammars. http:\/\/xxx.lanl.gov\/abs\/quant-ph\/9707031 . 336, 337"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"P. W. Shor: Algorithms for Quantum Computation: Discrete Logarithms and Factoring. Proc. 35th FOCS, 1994, pp. 124\u2013134. 336","DOI":"10.1109\/SFCS.1994.365700"},{"key":"22_CR15","unstructured":"M. Valdats: The Class of Languages Recognizable by 1-Way Quantum Finite Automata is not Closed Under Union. Proc. Quantum Computation and Learning. International Workshop, 2000, pp. 52\u201364. E-print: http:\/\/xxx.lanl.gov\/abs\/quantph\/0001005 . 337"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2000: Theory and Practice of Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44411-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T00:22:58Z","timestamp":1556497378000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44411-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540413486","9783540444114"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44411-4_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}