{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:36:03Z","timestamp":1725564963139},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228561"},{"type":"electronic","value":"9783540277989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27798-9_21","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:01:28Z","timestamp":1283727688000},"page":"179-187","source":"Crossref","is-referenced-by-count":1,"title":["On the Power of One-Sided Error Quantum Pushdown Automata with Classical Stack Operations"],"prefix":"10.1007","author":[{"given":"Masaki","family":"Nakanishi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0304-3975(02)00138-X","volume":"287","author":"A. Ambainis","year":"2002","unstructured":"Ambainis, A., Watrous, J.: Two-way finite automata with quantum and classical states. Theoretical Computer Science\u00a0287(1), 299\u2013311 (2002)","journal-title":"Theoretical Computer Science"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/3-540-44411-4_22","volume-title":"SOFSEM 2000: Theory and Practice of Informatics","author":"M. Golovkins","year":"2000","unstructured":"Golovkins, M.: Quantum Pushdown Automata. In: Jeffery, K., Hlav\u00e1\u010d, V., Wiedermann, J. (eds.) SOFSEM 2000. LNCS, vol.\u00a01963, pp. 336\u2013346. Springer, Heidelberg (2000)"},{"issue":"1-2","key":"21_CR3","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0304-3975(98)00191-1","volume":"237","author":"C. Moore","year":"2000","unstructured":"Moore, C., Crutchfield, J.P.: Quantum automata and quantum grammars. Theoretical Computer Science\u00a0237(1-2), 275\u2013306 (2000)","journal-title":"Theoretical Computer Science"},{"key":"21_CR4","unstructured":"Nakanishi, M., Indoh, T., Hamaguchi, K., Kashiwabara, T.: Expressive Power of Quantum Pushdown Automata with a Classical Stack. In: Calude, C.S., Dinneen, M.J., Peper, F. (eds.) UMC 2002. LNCS, vol.\u00a02509. Springer, Heidelberg (2002)"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF01694004","volume":"2","author":"W. Ogden","year":"1968","unstructured":"Ogden, W.: A Helpful Result for Proving inherent Ambiguity. Math. Syst. Theory\u00a02, 191\u2013194 (1968)","journal-title":"Math. Syst. Theory"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27798-9_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:26:31Z","timestamp":1620012391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27798-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228561","9783540277989"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27798-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}