{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:17:20Z","timestamp":1725466640761},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316524"},{"type":"electronic","value":"9783642316531"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31653-1_24","type":"book-chapter","created":{"date-parts":[[2012,7,14]],"date-time":"2012-07-14T09:51:39Z","timestamp":1342259499000},"page":"263-272","source":"Crossref","is-referenced-by-count":3,"title":["Two-Way Transducers with a Two-Way Output Tape"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Carton","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-22012-8_1","volume-title":"Automata, Languages and Programming","author":"R. Alur","year":"2011","unstructured":"Alur, R., Deshmukh, J.V.: Nondeterministic Streaming String Transducers. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 1\u201320. Springer, Heidelberg (2011)"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Berstel, J.: Transductions and Context-Free Languages. B.G. Teubner (1979)","DOI":"10.1007\/978-3-663-09367-1"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0304-3975(77)90049-4","volume":"5","author":"C. Choffrut","year":"1977","unstructured":"Choffrut, C.: Une caract\u00e9risation des fonctions s\u00e9quentielles et des fonctions sous-s\u00e9quentielles en tant que relations rationnelles. Theor. Comput. Sci.\u00a05, 325\u2013337 (1977)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"24_CR4","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1016\/S0019-9958(71)90483-9","volume":"18","author":"R.W. Ehrich","year":"1971","unstructured":"Ehrich, R.W., Yau, S.S.: Two-way sequential transductions and stack automata. Information and Control\u00a018(5), 404\u2013446 (1971)","journal-title":"Information and Control"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1147\/rd.91.0047","volume":"9","author":"C.C. Elgot","year":"1965","unstructured":"Elgot, C.C., Mezei, J.E.: On relations defined by generalized finite automata. IBM J. of Res. and Dev.\u00a09, 47\u201368 (1965)","journal-title":"IBM J. of Res. and Dev."},{"issue":"2","key":"24_CR6","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1145\/371316.371512","volume":"2","author":"J. Engelfriet","year":"2001","unstructured":"Engelfriet, J., Hoogeboom, H.J.: MSO definable string transductions and two-way finite-state transducers. ACM Trans. Comput. Log.\u00a02(2), 216\u2013254 (2001)","journal-title":"ACM Trans. Comput. Log."},{"issue":"3","key":"24_CR7","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1137\/0211035","volume":"11","author":"E.M. Gurari","year":"1982","unstructured":"Gurari, E.M.: The equivalence problem for deterministic two-way sequential transducers is decidable. SIAM J. Comput.\u00a011(3), 448\u2013452 (1982)","journal-title":"SIAM J. Comput."},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words, ch. 7, pp. 230\u2013268. Cambridge University Press (2002)","DOI":"10.1017\/CBO9781107326019"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0304-3975(77)90055-X","volume":"4","author":"M.-P. Sch\u00fctzenberger","year":"1976","unstructured":"Sch\u00fctzenberger, M.-P.: Sur les relations rationnelles entre mono\u00efdes libres. Theor. Comput. Sci.\u00a04, 47\u201357 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1147\/rd.32.0198","volume":"3","author":"J.C. Shepherdson","year":"1959","unstructured":"Shepherdson, J.C.: The reduction of two-way automata to one-way automata. IBM Journal of Research and Development\u00a03, 198\u2013200 (1959)","journal-title":"IBM Journal of Research and Development"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31653-1_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:08:40Z","timestamp":1606187320000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31653-1_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316524","9783642316531"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31653-1_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}