{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T05:59:12Z","timestamp":1769839152720,"version":"3.49.0"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319137483","type":"print"},{"value":"9783319137490","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13749-0_13","type":"book-chapter","created":{"date-parts":[[2014,12,5]],"date-time":"2014-12-05T03:36:33Z","timestamp":1417750593000},"page":"144-156","source":"Crossref","is-referenced-by-count":4,"title":["Quantum and Reversible Verification of Proofs Using Constant Memory Space"],"prefix":"10.1007","author":[{"given":"Marcos","family":"Villagra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomoyuki","family":"Yamakami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"13_CR1","doi-asserted-by":"publisher","first-page":"1456","DOI":"10.1137\/S0097539799353443","volume":"31","author":"A. Brodsky","year":"2002","unstructured":"Brodsky, A., Pippenger, N.: Characterizations of 1-way quantum finite automata. SIAM J. Comput.\u00a031(5), 1456\u20131478 (2002)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"13_CR2","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1145\/146585.146599","volume":"39","author":"C. Dwork","year":"1997","unstructured":"Dwork, C., Stockmeyer, L.: Finite state verifiers I: the power of interaction. J. ACM\u00a039(4), 800\u2013828 (1997)","journal-title":"J. ACM"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Gruska, J.: Quantum Computing. McGraw-Hill (2000)","DOI":"10.1007\/978-3-642-56478-9_27"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: Proc. of FOCS 1997, pp. 66\u201375 (1997)","DOI":"10.1109\/SFCS.1997.646094"},{"issue":"2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/s00037-005-0194-x","volume":"14","author":"C. Marriott","year":"2005","unstructured":"Marriott, C., Watrous, J.: Quantum Arthur-Merlin games. Computational Complexity\u00a014(2), 122\u2013152 (2005)","journal-title":"Computational Complexity"},{"issue":"1\u20132","key":"13_CR6","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. Theor. Comput. Sci.\u00a0237(1\u20132), 275\u2013306 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-540-30500-2_21","volume-title":"Implementation and Application of Automata","author":"H. Nishimura","year":"2005","unstructured":"Nishimura, H., Yamakami, T.: An application of quantum finite automata to interactive proof systems (extended abstract). In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol.\u00a03317, pp. 225\u2013236. Springer, Heidelberg (2005)"},{"issue":"4","key":"13_CR8","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.jcss.2008.12.001","volume":"75","author":"H. Nishimura","year":"2009","unstructured":"Nishimura, H., Yamakami, T.: An application of quantum finite automata to interactive proof systems. J. Comput. System Sci.\u00a075(4), 255\u2013269 (2009)","journal-title":"J. Comput. System Sci."},{"key":"13_CR9","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press (2000)"},{"key":"13_CR10","unstructured":"Yakaryilmaz, A.: Public-qubits versus private-qubits. Tech. Rep. TR12-130, Electronic Colloquium on Computational Complexity (2012)"},{"issue":"6","key":"13_CR11","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/j.ic.2011.01.008","volume":"279","author":"A. Yakaryilmaz","year":"2011","unstructured":"Yakaryilmaz, A., Say, A.C.C.: Unbounded-error quantum computation with small space bounds. Inform. Comput.\u00a0279(6), 873\u2013892 (2011)","journal-title":"Inform. Comput."},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Yamakami, T.: One-way reversible and quantum finite automata with advice. Inf. Comput. (in press, 2014), An extended abstract appeared in: Dediu, A.-H., Mart\u00edn-Vide, C. (eds.) LATA 2012. LNCS, vol.\u00a07183, pp. 526\u2013537. Springer, Heidelberg (2012)","DOI":"10.1016\/j.ic.2014.10.003"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/978-3-319-04298-5_45","volume-title":"SOFSEM 2014: Theory and Practice of Computer Science","author":"T. Yamakami","year":"2014","unstructured":"Yamakami, T.: Oracle pushdown automata, nondeterministic reducibilities, and the hierarchy over the family of context-free languages. In: Geffert, V., Preneel, B., Rovan, B., \u0160tuller, J., Tjoa, A.M. (eds.) SOFSEM 2014. LNCS, vol.\u00a08327, pp. 514\u2013525. Springer, Heidelberg (2014), A complete version appeared at arXiv:1303.1717 (2013)"},{"key":"13_CR14","unstructured":"Zheng, S., Gruska, J., Qiu, D.: Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata, arXiv:1304.387 (2013)"}],"container-title":["Lecture Notes in Computer Science","Theory and Practice of Natural Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13749-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T04:45:05Z","timestamp":1566103505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-13749-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319137483","9783319137490"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13749-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}