{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:20:29Z","timestamp":1737436829950,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424963"},{"type":"electronic","value":"9783540446835"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44683-4_13","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T01:32:38Z","timestamp":1188351158000},"page":"135-147","source":"Crossref","is-referenced-by-count":1,"title":["Exact Results for Accepting Probabilities of Quantum Automata"],"prefix":"10.1007","author":[{"given":"Andris","family":"Ambainis","sequence":"first","affiliation":[]},{"given":"Arnolds","family":"\u0136ikusts","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,5]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Andris Ambainis, Richard Bonner, R\u0169si\u0146\u0161 Freivalds, Arnolds \u0136ikusts. Probabilities to accept languages by quantum finite automata. Proceedings of COCOON\u201999, p. 174\u2013183. Also quant-ph\/9904066.","DOI":"10.1007\/3-540-48686-0_17"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Andris Ambainis, R\u0169si\u0146\u0161 Freivalds. 1-way quantum finite automata: strengths, weaknesses and generalizations. Proceedings of FOCS\u201998, p. 332\u2013341. Also quant-ph\/9802062.","DOI":"10.1109\/SFCS.1998.743469"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Andris Ambainis, Arnolds \u0136ikusts, M\u00e3ris Valdats. On the class of languages recognizable by 1-way quantum finite automata. Proceedings of STACS\u201901, p. 75\u201386. Also quant-ph\/0009004.","DOI":"10.1007\/3-540-44693-1_7"},{"key":"13_CR4","unstructured":"Andris Ambainis, John Watrous. Quantum automata with mixed states. In preparation, 2001."},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1137\/S0097539796300921","volume":"26","author":"E. Bernstein","year":"1997","unstructured":"Ethan Bernstein, Umesh Vazirani, Quantum complexity theory. SIAM Journal on Computing, 26:1411\u20131473, 1997.","journal-title":"SIAM Journal on Computing"},{"key":"13_CR6","unstructured":"Alex Brodsky, Nicholas Pippenger. Characterizations of 1-way quantum finite automata. quant-ph\/9903014."},{"key":"13_CR7","unstructured":"M. Pica Ciamarra. Quantum reversibility and a new type of quantum automaton. Proceedings of FCT\u201901, to appear."},{"key":"13_CR8","first-page":"191","volume":"5","author":"J. Gruska","year":"2000","unstructured":"Jozef Gruska. Descriptional complexity issues in quantum computing. Journal of Automata, Languages and Combinatorics, 5:191\u2013218, 2000.","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"13_CR9","unstructured":"Arnolds \u0136ikusts, Zigm\u00e3rs Ras\u0161\u010devskis. On the accepting probabilities of 1-way quantum finite automata. Proceedings of the workshop on Quantum Computing and Learning, 2000, p. 72\u201379."},{"key":"13_CR10","unstructured":"J. Kemeny, J. Snell. Finite Markov Chains. Springer-Verlag, 1976."},{"key":"13_CR11","unstructured":"Arnolds \u0136ikusts. A small 1-way quantum finite automaton. quant-ph\/9810065."},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Attila Kondacs and John Watrous. On the power of quantum finite state automata. In Proceedings of FOCS\u201997, p. 66\u201375.","DOI":"10.1109\/SFCS.1997.646094"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0304-3975(98)00191-1","volume":"237","author":"C. Moore","year":"2000","unstructured":"C. Moore, J. Crutchfield. Quantum automata and quantum grammars. Theoretical Computer Science, 237:275\u2013306, 2000. Also quant-ph\/9707031.","journal-title":"Theoretical Computer Science"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Ashwin Nayak. Optimal lower bounds for quantum automata and random access codes. Proceedings of FOCS\u201999, p. 369\u2013376. Also quant-ph\/9904093.","DOI":"10.1109\/SFFCS.1999.814608"},{"key":"13_CR15","unstructured":"Katrin Paschen. Quantum finite automata using ancilla qubits. University of Karlsruhe technical report."},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"John Watrous. Relationships between quantum and classical space-bounded complexity classes. Proceedings of Complexity\u201998, p. 210\u2013227.","DOI":"10.1109\/CCC.1998.694607"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44683-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T18:28:06Z","timestamp":1737397686000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44683-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424963","9783540446835"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44683-4_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}