{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T05:29:51Z","timestamp":1738387791191,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540874409"},{"type":"electronic","value":"9783540874423"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87442-3_1","type":"book-chapter","created":{"date-parts":[[2008,9,7]],"date-time":"2008-09-07T21:21:42Z","timestamp":1220822502000},"page":"1-8","source":"Crossref","is-referenced-by-count":6,"title":["Some Observations on Two-Way Finite Automata with Quantum and Classical States"],"prefix":"10.1007","author":[{"given":"Daowen","family":"Qiu","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Freivalds, R.: One-way quantum finite automata: strengths, weaknesses and generalizations. In: Proc. 39th FOCS, pp. 332\u2013341 (1998)","DOI":"10.1109\/SFCS.1998.743469"},{"key":"1_CR2","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. Theoret. Comput. Sci.\u00a0287, 299\u2013311 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/BF01011339","volume":"22","author":"P. Benioff","year":"1980","unstructured":"Benioff, P.: The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines. J. of Stat.Phys.\u00a022, 563\u2013591 (1980)","journal-title":"J. of Stat.Phys."},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45007-6_1","volume-title":"Developments in Language Theory","author":"A. Bertoni","year":"2003","unstructured":"Bertoni, A., Mereghetti, C., Palano, B.: Quantum Computing: 1-Way Quantum Automata. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol.\u00a02710, pp. 1\u201320. Springer, Heidelberg (2003)"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"1456","DOI":"10.1137\/S0097539799353443","volume":"31","author":"A. Broadsky","year":"2002","unstructured":"Broadsky, A., Pippenger, N.: Characterizations of 1-way quantum finite automata. SIAM J. Comput.\u00a031, 1456\u20131478 (2002)","journal-title":"SIAM J. Comput."},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1098\/rspa.1985.0070","volume":"400","author":"D. Deutsch","year":"1985","unstructured":"Deutsch, D.: Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. R. Soc. Lond. A.\u00a0400, 97\u2013117 (1985)","journal-title":"Proc. R. Soc. Lond. A."},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1137\/0219069","volume":"19","author":"C. Dwork","year":"1990","unstructured":"Dwork, C., Stockmeyer, L.: A time-complexity gap for two-way probabilistic finite state automata. SIAM J. Comput.\u00a019, 1011\u20131023 (1990)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"1_CR8","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1145\/146585.146599","volume":"39","author":"C. Dwork","year":"1992","unstructured":"Dwork, C., Stockmeyer, L.: Finite state verifier I: the power of interaction. J. ACM.\u00a039(4), 800\u2013828 (1992)","journal-title":"J. ACM."},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/BF02650179","volume":"21","author":"R.P. Feynman","year":"1982","unstructured":"Feynman, R.P.: Simulating physics with computers. Internat. J.Theoret.Phys.\u00a021, 467\u2013488 (1982)","journal-title":"Internat. J.Theoret.Phys."},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/3-540-10856-4_72","volume-title":"Mathematical Foundations of Computer Science 1981","author":"R. Freivalds","year":"1981","unstructured":"Freivalds, R.: Probabilistic two-way machines. In: Gruska, J., Chytil, M.P. (eds.) MFCS 1981. LNCS, vol.\u00a0118, pp. 33\u201345. Springer, Heidelberg (1981)"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Grover, L.: A fast quantum mechanical algorithms for datdbase search. In: Proc. 28th STOC, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"1_CR12","volume-title":"Quantum Computing","author":"J. Gruska","year":"1999","unstructured":"Gruska, J.: Quantum Computing. McGraw-Hill, London (1999)"},{"issue":"1","key":"1_CR13","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/0022-0000(86)90045-0","volume":"33","author":"A. Greenberg","year":"1986","unstructured":"Greenberg, A., Weiss, A.: A lower bound for probabilistic algorithms for finite state machines. J. Comput. System Sci.\u00a033(1), 88\u2013105 (1986)","journal-title":"J. Comput. System Sci."},{"key":"1_CR14","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, New York (1979)"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-54233-7_133","volume-title":"Automata, Languages and Programming","author":"J. Kaneps","year":"1991","unstructured":"Kaneps, J., Freivalds, R.: Running time to recognize nonregular languages by 2-way probabilistic automata. In: Leach Albert, J., Monien, B., Rodr\u00edguez-Artalejo, M. (eds.) ICALP 1991. LNCS, vol.\u00a0510, pp. 174\u2013185. Springer, Heidelberg (1991)"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Kondacs, A., Watrous, J.: On the power of finite state automata. In: Proc. 38th FOCS, pp. 66\u201375 (1997)","DOI":"10.1109\/SFCS.1997.646094"},{"key":"1_CR17","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. Theoret. Comput. Sci.\u00a0237, 275\u2013306 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Qiu, D.W.: Some observations on two-way finite automata with quantum and classical states, quant-ph\/0701187 (2007)","DOI":"10.1007\/978-3-540-87442-3_1"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithm for quantum computation: discrete logarithms and factoring. In: Proc. 35th FOCS, pp. 124\u2013134 (1994)","DOI":"10.1109\/SFCS.1994.365700"}],"container-title":["Lecture Notes in Computer Science","Advanced Intelligent Computing Theories and Applications. With Aspects of Theoretical and Methodological Issues"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87442-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T21:26:51Z","timestamp":1738358811000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87442-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540874409","9783540874423"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87442-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}