{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:53:54Z","timestamp":1750308834745,"version":"3.41.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319601335"},{"type":"electronic","value":"9783319601342"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-60134-2_13","type":"book-chapter","created":{"date-parts":[[2017,5,27]],"date-time":"2017-05-27T12:53:09Z","timestamp":1495889589000},"page":"151-162","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Transducing Reversibly with Finite State Machines"],"prefix":"10.1007","author":[{"given":"Martin","family":"Kutrib","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Malcher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Wendlandt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,28]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01703920","volume":"3","author":"AV Aho","year":"1969","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: A general theory of translation. Math. Syst. Theor. 3, 193\u2013221 (1969)","journal-title":"Math. Syst. Theor."},{"key":"13_CR2","unstructured":"Aho, A.V., Ullman, J.D.: The theory of parsing, translation, and compiling. Parsing, vol. I. Prentice-Hall (1972)"},{"key":"13_CR3","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 29, 741\u2013765 (1982)","journal-title":"J. ACM"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-319-20860-2_2","volume-title":"Reversible Computation","author":"HB Axelsen","year":"2015","unstructured":"Axelsen, H.B., Jakobi, S., Kutrib, M., Malcher, A.: A hierarchy of fast reversible turing machines. In: Krivine, J., Stefani, J.-B. (eds.) RC 2015. LNCS, vol. 9138, pp. 29\u201344. Springer, Cham (2015). doi:10.1007\/978-3-319-20860-2_2"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"17","author":"CH Bennett","year":"1973","unstructured":"Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17, 525\u2013532 (1973)","journal-title":"IBM J. Res. Dev."},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-319-40946-7_3","volume-title":"Implementation and Application of Automata","author":"S Bensch","year":"2016","unstructured":"Bensch, S., Bj\u00f6rklund, J., Kutrib, M.: Deterministic stack transducers. In: Han, Y.-S., Salomaa, K. (eds.) CIAA 2016. LNCS, vol. 9705, pp. 27\u201338. Springer, Cham (2016). doi:10.1007\/978-3-319-40946-7_3"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Berstel, J.: Transductions and Context-Free-Languages. Teubner (1979)","DOI":"10.1007\/978-3-663-09367-1"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-319-21500-6_22","volume-title":"Developments in Language Theory","author":"M Holzer","year":"2015","unstructured":"Holzer, M., Jakobi, S., Kutrib, M.: Minimal reversible deterministic finite automata. In: Potapov, I. (ed.) DLT 2015. LNCS, vol. 9168, pp. 276\u2013287. Springer, Cham (2015). doi:10.1007\/978-3-319-21500-6_22"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: Foundations of Computer Science (FOCS 1997), pp. 66\u201375. IEEE Computer Society (1997)","DOI":"10.1109\/SFCS.1997.646094"},{"key":"13_CR10","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. 78, 1814\u20131827 (2012)","journal-title":"J. Comput. System Sci."},{"key":"13_CR11","doi-asserted-by":"crossref","first-page":"201","DOI":"10.3233\/FI-2013-878","volume":"126","author":"M Kutrib","year":"2013","unstructured":"Kutrib, M., Malcher, A.: One-dimensional cellular automaton transducers. Fundam. Inform. 126, 201\u2013224 (2013)","journal-title":"Fundam. Inform."},{"key":"13_CR12","unstructured":"Kutrib, M., Malcher, A.: One-way reversible multi-head finite automata. Theor. Comput. Sci., to appear"},{"key":"13_CR13","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. 5, 183\u2013191 (1961)","journal-title":"IBM J. Res. Dev."},{"key":"13_CR14","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. Syst. Sci. 60, 354\u2013367 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR15","first-page":"2597","volume":"257","author":"Y Lecerf","year":"1963","unstructured":"Lecerf, Y.: Logique math\u00e9matique: machines de Turing r\u00e9versible. C.R. S\u00e9ances Acad. Sci. 257, 2597\u20132600 (1963)","journal-title":"C.R. S\u00e9ances Acad. Sci."},{"key":"13_CR16","first-page":"241","volume":"110","author":"K Morita","year":"2011","unstructured":"Morita, K.: Two-way reversible multi-head finite automata. Fund. Inform. 110, 241\u2013254 (2011)","journal-title":"Fund. Inform."},{"key":"13_CR17","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. 583, pp. 401\u2013416. Springer, Heidelberg (1992). doi:10.1007\/BFb0023844"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60134-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:40:28Z","timestamp":1750279228000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-60134-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319601335","9783319601342"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60134-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"28 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marne-la-Vall\u00e9e","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ciaa17.univ-mlv.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}