{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:56:32Z","timestamp":1725796592490},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319084930"},{"type":"electronic","value":"9783319084947"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08494-7_4","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T10:50:00Z","timestamp":1404557400000},"page":"40-53","source":"Crossref","is-referenced-by-count":8,"title":["Degrees of Reversibility for DFA and DPDA"],"prefix":"10.1007","author":[{"given":"Martin","family":"Kutrib","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Worsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Parsing","volume-title":"The theory of parsing, translation, and compiling","author":"A.V. Aho","year":"1972","unstructured":"Aho, A.V., Ullman, J.D.: The theory of parsing, translation, and compiling. Parsing, vol.\u00a0I. Prentice-Hall Inc., Englewood Cliffs (1972)"},{"issue":"3","key":"4_CR2","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1145\/322326.322334","volume":"29","author":"D. Angluin","year":"1982","unstructured":"Angluin, D.: Inference of reversible languages. J. ACM\u00a029(3), 741\u2013765 (1982)","journal-title":"J. ACM"},{"key":"4_CR3","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":"4_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 J. Res. Dev.\u00a017, 525\u2013532 (1973)","journal-title":"IBM J. Res. Dev."},{"issue":"3","key":"4_CR5","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1145\/321127.321132","volume":"9","author":"S. Ginsburg","year":"1962","unstructured":"Ginsburg, S., Rice, H.G.: Two families of languages related to ALGOL. J. ACM\u00a09(3), 350\u2013371 (1962)","journal-title":"J. ACM"},{"key":"4_CR6","volume-title":"Introduction to Formal Language Theory","author":"M.A. Harrison","year":"1978","unstructured":"Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Reading (1978)"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0304-3975(96)00224-1","volume":"174","author":"S. Kobayashi","year":"1997","unstructured":"Kobayashi, S., Yokomori, T.: Learning approximately regular languages with reversible languages. Theoret. Comput. Sci.\u00a0174, 251\u2013257 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"1814","DOI":"10.1016\/j.jcss.2011.12.004","volume":"78","author":"M. Kutrib","year":"2012","unstructured":"Kutrib, M., Malcher, A.: Reversible pushdown automata. J. Comput. System Sci.\u00a078, 1814\u20131827 (2012)","journal-title":"J. Comput. System Sci."},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1147\/rd.53.0183","volume":"5","author":"R. Landauer","year":"1961","unstructured":"Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev.\u00a05, 183\u2013191 (1961)","journal-title":"IBM J. Res. Dev."},{"key":"4_CR10","unstructured":"Morita, K., Shirasaki, A., Gono, Y.: A 1-tape 2-symbol reversible Turing machine. Trans. IEICE E72, 223\u2013228 (1989)"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BFb0023844","volume-title":"LATIN \u201992","author":"J.E. Pin","year":"1992","unstructured":"Pin, J.E.: On reversible automata. In: Simon, I. (ed.) LATIN 1992. LNCS, vol.\u00a0583, pp. 401\u2013416. Springer, Heidelberg (1992)"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08494-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,9,22]],"date-time":"2018-09-22T04:25:14Z","timestamp":1537590314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08494-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319084930","9783319084947"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08494-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}