{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:23:17Z","timestamp":1725488597898},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424871"},{"type":"electronic","value":"9783540446699"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44669-9_37","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:32:26Z","timestamp":1186741946000},"page":"380-383","source":"Crossref","is-referenced-by-count":0,"title":["Space-Efficient 1.5-Way Quantum Turing Machine"],"prefix":"10.1007","author":[{"given":"Andrej","family":"Dubrovsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"Masami Amano, Kazuo Iwama. Undecidability on quantum finite automata. Proc. STOC, p. 368\u2013375, 1999.","DOI":"10.1145\/301250.301344"},{"key":"37_CR2","volume-title":"Quantum computing","author":"J. Gruska","year":"1999","unstructured":"Jozef Gruska. Quantum computing. McGraw-Hill, London et al, 1999."},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"P. M. Lewis II, R. E. Stearns, and J. Hartmanis. Memory bounds for recogniton of context-free and context-sensitive languages. Proc. FOCS, p. 191\u2013202, 1965.","DOI":"10.1109\/FOCS.1965.14"},{"key":"37_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/3-540-10856-4_72","volume-title":"Probabilistic two-way machines","author":"R. Freivalds","year":"1981","unstructured":"R\u0169si\u0146\u0161 Freivalds. Probabilistic two-way machines. LNCS, v.118, p.33\u201345, 1981."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44669-9_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T22:13:01Z","timestamp":1556748781000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44669-9_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424871","9783540446699"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-44669-9_37","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}