{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T05:30:39Z","timestamp":1738387839556,"version":"3.35.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2008,9,16]],"date-time":"2008-09-16T00:00:00Z","timestamp":1221523200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1007\/s11128-008-0083-8","type":"journal-article","created":{"date-parts":[[2008,9,15]],"date-time":"2008-09-15T15:41:13Z","timestamp":1221493273000},"page":"211-225","source":"Crossref","is-referenced-by-count":0,"title":["Some algebraic properties of measure-once two-way quantum finite automata"],"prefix":"10.1007","volume":"7","author":[{"given":"Zhengjun","family":"Xi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongming","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,9,16]]},"reference":[{"key":"83_CR1","doi-asserted-by":"crossref","unstructured":"Ablayev, F., Gainutdinova, A.: On the Lower Bounds for One-way Quantum Automata. Lecture Notes in Computer Science, pp. 133\u2013140 (2000)","DOI":"10.1007\/3-540-44612-5_9"},{"key":"83_CR2","doi-asserted-by":"crossref","unstructured":"Amano, M., Iwama, K.: Undecidability on quantum finite automata. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, Atlanta, Georgia, pp. 368\u2013375 (1999)","DOI":"10.1145\/301250.301344"},{"key":"83_CR3","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Freivalds, R.: One-way quantum finite automata: strengths, weaknesses and generalizations. In: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, Palo Alfo, California, pp.\u00a0332\u2013341 (1998)","DOI":"10.1109\/SFCS.1998.743469"},{"key":"83_CR4","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Kikusts, A., Valdat, M.: On the Class of Languages Recognizable by 1-Way Quantum Finite Automata. Lecture Notes in Computer Science, pp. 75\u201386 (2001)","DOI":"10.1007\/3-540-44693-1_7"},{"key":"83_CR5","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 287, 299\u2013311 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"83_CR6","doi-asserted-by":"crossref","unstructured":"Andrew Chi-Chih Yao.: Quantum circuit complexity. In: Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, pp. 352\u2013361 (1993)","DOI":"10.1109\/SFCS.1993.366852"},{"key":"83_CR7","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01342185","volume":"29","author":"P. Benioff","year":"1982","unstructured":"Benioff P.: Quantum mechanical hamiltonian models of turingmachines. J. Stat. Phys. 29, 515\u2013546 (1982)","journal-title":"J. Stat. Phys."},{"issue":"5","key":"83_CR8","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.1137\/S0097539796300921","volume":"26","author":"E. Bernstein","year":"1997","unstructured":"Bernstein E., Vazirani U.: Quantum complexity theory. SIAM J. Comput. 26(5), 1411\u20131473 (1997)","journal-title":"SIAM J. Comput."},{"key":"83_CR9","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1006\/inco.2000.2911","volume":"165","author":"A. Bertoni","year":"2001","unstructured":"Bertoni A., Carpentieri M.: Regular languages accepted by quantum automata. Inf. Comput. 165, 174\u2013182 (2001)","journal-title":"Inf. Comput."},{"key":"83_CR10","doi-asserted-by":"crossref","unstructured":"Bertoni, A., Mereghetti, C., Palano, B.: Quantum Computing: 1-Way Quantum Automata. Lecture Notes in Computer Science, pp. 1\u201320 (2003)","DOI":"10.1007\/3-540-45007-6_1"},{"key":"83_CR11","doi-asserted-by":"crossref","unstructured":"Bertoni, A., Mereghetti, C., Palano, B.: Lower Bounds on the Size of Quantum Automata Accepting Unary Languages. Lecture Notes in Computer Science, pp. 86\u201396 (2003)","DOI":"10.1007\/978-3-540-45208-9_8"},{"key":"83_CR12","doi-asserted-by":"crossref","unstructured":"Brodsky, A., Pippenger, N.: Characterizations of 1-way quantum finite automata. SIAM J. Comput. 31(5), appeared earlier as Technical Report TR-99-03, University of British Columbia (1999), pp.\u00a01456\u20131478 (2002)","DOI":"10.1137\/S0097539799353443"},{"key":"83_CR13","doi-asserted-by":"crossref","first-page":"73","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. A 400, 73\u201390 (1985)","journal-title":"Proc. R. Soc. A"},{"key":"83_CR14","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1098\/rspa.1989.0099","volume":"425","author":"D. Deutsch","year":"1989","unstructured":"Deutsch D.: Quantum computational networks. Proc. R. Soc. A 425, 73\u201390 (1989)","journal-title":"Proc. R. Soc. A"},{"key":"83_CR15","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/S0304-3975(00)00298-X","volume":"267","author":"G. Duchamp","year":"2001","unstructured":"Duchamp G., Flouret M., Laugerotte E., Luque J.G.: Direct and dual laws for automata with multiplicities. Theor. Comput. Sci. 267, 105\u2013120 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"83_CR16","volume-title":"Quantum Computing","author":"J. Gruska","year":"1999","unstructured":"Gruska J.: Quantum Computing. McGraw Hill, NY (1999)"},{"key":"83_CR17","volume-title":"An Introduction to Automata Theory, Languages and Computation","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft J., Ullman J.: An Introduction to Automata Theory, Languages and Computation. Addison-Wesley, NY (1979)"},{"key":"83_CR18","doi-asserted-by":"crossref","unstructured":"Iwama1, K., Nishimura, H., Raymond, R., Yamashita, S.: Unbounded-error One-way Classical and Quantum Communication Complexity. Lecture Notes in Computer Science, pp. 100\u2013121 (2007)","DOI":"10.1007\/978-3-540-77120-3_11"},{"key":"83_CR19","doi-asserted-by":"crossref","unstructured":"Kondacs, A., Watrous, J.: On the power of finite state automata. In: Proceedings of the 38th IEEE Annual Symposium on Foundations of Computer Science, pp.\u00a066\u201375 (1997)","DOI":"10.1109\/SFCS.1997.646094"},{"key":"83_CR20","unstructured":"Macko, M.: On closure properties of quantum finite automata. Diploma thesis, Comenius University (2006)"},{"key":"83_CR21","unstructured":"Marcus, M., Minc, H.: Introduction to Linear Algebra. The Macmillan Company, NY (1965), Reprinted by Dover (1988)"},{"key":"83_CR22","doi-asserted-by":"crossref","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. 237, 275\u2013306 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"83_CR23","unstructured":"Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"key":"83_CR24","doi-asserted-by":"crossref","unstructured":"Qiu, D.W.: Some observations on two-way finite automata with quantum and classical states. http:\/\/www.lanl.arxiv.org\/abs\/quant-ph\/0701187v1","DOI":"10.1007\/978-3-540-87442-3_1"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-008-0083-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-008-0083-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-008-0083-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T23:06:09Z","timestamp":1738364769000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-008-0083-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,16]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["83"],"URL":"https:\/\/doi.org\/10.1007\/s11128-008-0083-8","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"type":"print","value":"1570-0755"},{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2008,9,16]]}}}