{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:21Z","timestamp":1760202621697},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642283314"},{"type":"electronic","value":"9783642283321"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28332-1_9","type":"book-chapter","created":{"date-parts":[[2012,2,29]],"date-time":"2012-02-29T14:45:36Z","timestamp":1330526736000},"page":"95-105","source":"Crossref","is-referenced-by-count":7,"title":["Reversible Multi-head Finite Automata Characterize Reversible Logarithmic Space"],"prefix":"10.1007","author":[{"given":"Holger Bock","family":"Axelsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"LNCS","volume-title":"RC 2011","author":"H.B. Axelsen","year":"2012","unstructured":"Axelsen, H.B.: Time Complexity of Tape Reduction for Reversible Turing Machines. In: De Vos, A., Wille, R. (eds.) RC 2011. LNCS, vol.\u00a07165, Springer, Heidelberg (2012)"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-21254-3_8","volume-title":"Language and Automata Theory and Applications","author":"H.B. Axelsen","year":"2011","unstructured":"Axelsen, H.B., Gl\u00fcck, R.: A Simple and Efficient Universal Reversible Turing Machine. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol.\u00a06638, pp. 117\u2013128. Springer, Heidelberg (2011)"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-19805-2_4","volume-title":"Foundations of Software Science and Computational Structures","author":"H.B. Axelsen","year":"2011","unstructured":"Axelsen, H.B., Gl\u00fcck, R.: What Do Reversible Programs Compute? In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol.\u00a06604, pp. 42\u201356. Springer, Heidelberg (2011)"},{"issue":"6","key":"9_CR4","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"17","author":"C.H. Bennett","year":"1973","unstructured":"Bennett, C.H.: Logical reversibility of computation. IBM Journal of Research and Development\u00a017(6), 525\u2013532 (1973)","journal-title":"IBM Journal of Research and Development"},{"issue":"4","key":"9_CR5","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/BF00289513","volume":"1","author":"J. Hartmanis","year":"1972","unstructured":"Hartmanis, J.: On non-determinancy in simple computing devices. Acta Informatica\u00a01(4), 336\u2013344 (1972)","journal-title":"Acta Informatica"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Holzer, M., Kutrib, M., Malcher, A.: Multi-head finite automata: Characterizations, concepts and open problems. In: Neary, T., Woods, D., Seda, A.K., Murphy, N. (eds.) Complexity of Simple Programs. EPTCS, vol.\u00a01, pp. 93\u2013107 (2008)","DOI":"10.4204\/EPTCS.1.9"},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/S0022-0000(73)80048-0","volume":"7","author":"O.H. Ibarra","year":"1973","unstructured":"Ibarra, O.H.: On two-way multihead automata. J. Comput. and Sys. Sci.\u00a07(1), 28\u201336 (1973)","journal-title":"J. Comput. and Sys. Sci."},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-642-13089-2_31","volume-title":"Language and Automata Theory and Applications","author":"M. Kutrib","year":"2010","unstructured":"Kutrib, M., Malcher, A.: Reversible Pushdown Automata. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol.\u00a06031, pp. 368\u2013379. Springer, Heidelberg (2010)"},{"issue":"2","key":"9_CR9","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1006\/jcss.1999.1672","volume":"60","author":"K.-J. Lange","year":"2000","unstructured":"Lange, K.-J., McKenzie, P., Tapp, A.: Reversible space equals deterministic space. J. Comput. and Sys. Sci.\u00a060(2), 354\u2013367 (2000)","journal-title":"J. Comput. and Sys. Sci."},{"key":"9_CR10","unstructured":"Morita, K.: Reversible multi-head finite automata and languages accepted by them (extended abstract). In: Wille, R., De Vos, A. (eds.) Proceedings of the 3rd Workshop on Reversible Computation, pp. 25\u201330. Universiteit Gent (2011)"},{"issue":"1-4","key":"9_CR11","doi-asserted-by":"crossref","first-page":"241","DOI":"10.3233\/FI-2011-541","volume":"110","author":"K. Morita","year":"2011","unstructured":"Morita, K.: Two-way reversible multi-head finite automata. Fundamenta Informaticae\u00a0110(1-4), 241\u2013254 (2011)","journal-title":"Fundamenta Informaticae"},{"issue":"3","key":"9_CR12","first-page":"223","volume":"72","author":"K. Morita","year":"1989","unstructured":"Morita, K., Shirasaki, A., Gono, Y.: A 1-tape 2-symbol reversible Turing machine. Transactions of the IEICE E\u00a072(3), 223\u2013228 (1989)","journal-title":"Transactions of the IEICE E"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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 Languages Accepted by Finite Reversible Automata. In: Ottmann, T. (ed.) ICALP 1987. LNCS, vol.\u00a0267, pp. 237\u2013249. Springer, Heidelberg (1987)"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-70583-3_22","volume-title":"Automata, Languages and Programming","author":"T. Yokoyama","year":"2008","unstructured":"Yokoyama, T., Axelsen, H.B., Gl\u00fcck, R.: Reversible Flowchart Languages and the Structured Reversible Program Theorem. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 258\u2013270. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28332-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,3]],"date-time":"2020-07-03T12:30:33Z","timestamp":1593779433000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28332-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642283314","9783642283321"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28332-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}