{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:35:42Z","timestamp":1725557742200},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135224"},{"type":"electronic","value":"9783642135231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13523-1_18","type":"book-chapter","created":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T04:34:26Z","timestamp":1277267666000},"page":"164-174","source":"Crossref","is-referenced-by-count":1,"title":["Quantum Computation with Devices Whose Contents Are Never Read"],"prefix":"10.1007","author":[{"given":"Abuzer","family":"Yakary\u0131lmaz","sequence":"first","affiliation":[]},{"given":"R\u016bsi\u0146\u0161","family":"Freivalds","sequence":"additional","affiliation":[]},{"given":"A. C. Cem","family":"Say","sequence":"additional","affiliation":[]},{"given":"Ruben","family":"Agadzanyan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach","author":"S. Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, New York (2009)"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/3-540-44669-9_36","volume-title":"Fundamentals of Computation Theory","author":"M.P. Ciamarra","year":"2001","unstructured":"Ciamarra, M.P.: Quantum reversibility and a new model of quantum automaton. In: Freivalds, R. (ed.) FCT 2001. LNCS, vol.\u00a02138, pp. 376\u2013379. Springer, Heidelberg (2001)"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1007\/3-540-58201-0_100","volume-title":"Automata, Languages, and Programming","author":"R. Freivalds","year":"1994","unstructured":"Freivalds, R., Karpinski, M.: Lower space bounds for randomized computation. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol.\u00a0820, pp. 580\u2013592. Springer, Heidelberg (1994)"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/3-540-45627-9_20","volume-title":"SOFSEM 2001: Theory and Practice of Informatics","author":"R. Freivalds","year":"2001","unstructured":"Freivalds, R., Winter, A.J.: Quantum finite state transducers. In: Pacholski, L., Ru\u017ei\u010dka, P. (eds.) SOFSEM 2001. LNCS, vol.\u00a02234, pp. 233\u2013242. Springer, Heidelberg (2001)"},{"issue":"4","key":"18_CR5","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s00224-006-1314-y","volume":"40","author":"E. Jeandel","year":"2007","unstructured":"Jeandel, E.: Topological automata. Theory of Computing Systems\u00a040(4), 397\u2013407 (2007)","journal-title":"Theory of Computing Systems"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: FOCS 1997: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, Miami, Florida, pp. 66\u201375 (1997)","DOI":"10.1109\/SFCS.1997.646094"},{"issue":"1-2","key":"18_CR7","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":"18_CR8","unstructured":"Paschen, K.: Quantum finite automata using ancilla qubits. Technical report, University of Karlsruhe (2000)"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/3-540-18088-5_19","volume-title":"Automata, Languages and Programming","author":"J.-E. Pin","year":"1987","unstructured":"Pin, J.-E.: On the language accepted by finite reversible automata. In: Ottmann, T. (ed.) ICALP 1987. LNCS, vol.\u00a0267, pp. 237\u2013249. Springer, Heidelberg (1987)"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/S0019-9958(63)90290-0","volume":"6","author":"M.O. Rabin","year":"1963","unstructured":"Rabin, M.O.: Probabilistic automata. Information and Control\u00a06, 230\u2013243 (1963)","journal-title":"Information and Control"},{"key":"18_CR11","unstructured":"Say, A.C.C., Yakaryilmaz, A.: Quantum function computation using sublogarithmic space (2010) (Poster presentation at QIP 2010)"},{"key":"18_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-60322-8","volume-title":"Gems of Theoretical Computer Science","author":"U. Sch\u00f6ning","year":"1998","unstructured":"Sch\u00f6ning, U., Pruim, R.: Gems of Theoretical Computer Science. Springer, Heidelberg (1998)"},{"key":"18_CR13","unstructured":"Watrous, J.: Space-bounded quantum computation. PhD thesis, University of Wisconsin - Madison, USA (1998)"},{"issue":"1\/2","key":"18_CR14","first-page":"48","volume":"12","author":"J. Watrous","year":"2004","unstructured":"Watrous, J.: On the complexity of simulating space-bounded quantum computations. Computational Complexity\u00a012(1\/2), 48\u201384 (2004)","journal-title":"Computational Complexity"},{"key":"18_CR15","unstructured":"Yao, A.C.-C.: Quantum circuit complexity. In: Proceedings of the 34th Annual Symposium on Foundations of Computer Science, pp. 352\u2013361 (1993)"}],"container-title":["Lecture Notes in Computer Science","Unconventional Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13523-1_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:06:14Z","timestamp":1619784374000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13523-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135224","9783642135231"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13523-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}