{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:49:00Z","timestamp":1764557340705},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319208596"},{"type":"electronic","value":"9783319208602"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20860-2_2","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T08:15:57Z","timestamp":1434701757000},"page":"29-44","source":"Crossref","is-referenced-by-count":5,"title":["A Hierarchy of Fast Reversible Turing Machines"],"prefix":"10.1007","author":[{"given":"Holger Bock","family":"Axelsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Jakobi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Kutrib","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Malcher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-29517-1_1","volume-title":"Reversible Computation","author":"HB 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. 7165, pp. 1\u201313. Springer, Heidelberg (2012)"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1137\/0218053","volume":"18","author":"CH Bennett","year":"1989","unstructured":"Bennett, C.H.: Time\/space trade-offs for reversible computation. SIAM J. Comput. 18, 766\u2013776 (1989)","journal-title":"SIAM J. Comput."},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1109\/T-C.1969.222663","volume":"18","author":"SN Cole","year":"1969","unstructured":"Cole, S.N.: Real-time computation by \n                      \n                        \n                      \n                      $$n$$\n                      \n                        \n                          n\n                        \n                      \n                    -dimensional iterative arrays of finite-state machines. IEEE Trans. Comput. 18, 349\u2013365 (1969)","journal-title":"IEEE Trans. Comput."},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","volume":"117","author":"J Hartmanis","year":"1965","unstructured":"Hartmanis, J., Stearns, R.E.: On the computational complexity of algorithms. Trans. Amer. Math. Soc. 117, 285\u2013306 (1965)","journal-title":"Trans. Amer. Math. Soc."},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/S0019-9958(65)90399-2","volume":"8","author":"FC Hennie","year":"1965","unstructured":"Hennie, F.C.: One-tape, off-line Turing machine computations. Inform. Control 8, 553\u2013578 (1965)","journal-title":"Inform. Control"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1137\/0403020","volume":"3","author":"G Jacopini","year":"1990","unstructured":"Jacopini, G., Mentrasti, P., Sontacchi, G.: Reversible Turing machines and polynomial time reversibly computable functions. SIAM J. Disc. Math. 3, 241\u2013254 (1990)","journal-title":"SIAM J. Disc. Math."},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0304-3975(01)00272-9","volume":"289","author":"A Klein","year":"2002","unstructured":"Klein, A., Kutrib, M.: Deterministic Turing machines in the range between real-time and linear-time. Theoret. Comput. Sci. 289, 253\u2013275 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1006\/jcss.1999.1672","volume":"60","author":"KJ Lange","year":"2000","unstructured":"Lange, K.J., McKenzie, P., Tapp, A.: Reversible space equals deterministic space. J. Comput. System Sci. 60, 354\u2013367 (2000)","journal-title":"J. Comput. System Sci."},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Li, M., Vit\u00e1nyi, P.M.B.: An Introduction to Kolmogorov Complexity and Its Applications. Springer (1993)","DOI":"10.1007\/978-1-4757-3860-5"},{"key":"2_CR10","unstructured":"Paul, W.J.: Komplexit\u00e4tstheorie. Teubner (1978)"},{"key":"2_CR11","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 Pin","year":"1987","unstructured":"Pin, J.: On the language accepted by finite reversible automata. In: Ottmann, T. (ed.) Automata, Languages and Programming. LNCS, vol. 267, pp. 237\u2013249. Springer, Heidelberg (1987)"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1145\/321420.321423","volume":"14","author":"AL Rosenberg","year":"1967","unstructured":"Rosenberg, A.L.: Real-time definable languages. J. ACM 14, 645\u2013662 (1967)","journal-title":"J. ACM"},{"key":"2_CR13","first-page":"33","volume":"3","author":"BA Trakhtenbrot","year":"1964","unstructured":"Trakhtenbrot, B.A.: Turing machine computations with logarithmic delay. Algebra i Logika 3, 33\u201348 (1964)","journal-title":"Algebra i Logika"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Vit\u00e1nyi, P.M.B.: Time, space, and energy in reversible computing. In: Bagherzadeh, N., Valero, M., Ram\u00edrez, A. (eds.) Computing Frontiers (CF 2005), pp. 435\u2013444. ACM (2005)","DOI":"10.1145\/1062261.1062335"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20860-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T07:04:13Z","timestamp":1559199853000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-20860-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319208596","9783319208602"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20860-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}