{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:49:45Z","timestamp":1743151785020,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662531310"},{"type":"electronic","value":"9783662531327"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-53132-7_10","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T21:25:06Z","timestamp":1468963506000},"page":"114-124","source":"Crossref","is-referenced-by-count":0,"title":["Both Ways Rational Functions"],"prefix":"10.1007","author":[{"given":"Christian","family":"Choffrut","sequence":"first","affiliation":[]},{"given":"Bruno","family":"Guillon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,21]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and Context-Free Languages","author":"J Berstel","year":"1979","unstructured":"Berstel, J.: Transductions and Context-Free Languages. B. G. Teubner, Stuttgart (1979)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/978-3-662-44522-8_17","volume-title":"Mathematical Foundations of Computer Science 2014","author":"C Choffrut","year":"2014","unstructured":"Choffrut, C., Guillon, B.: An algebraic characterization of unary two-way transducers. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014, Part I. LNCS, vol. 8634, pp. 196\u2013207. Springer, Heidelberg (2014)"},{"key":"10_CR3","volume-title":"Automata, Languages and Machines","author":"S Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages and Machines, vol. A. Academic Press, New York (1974)"},{"key":"10_CR4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1147\/rd.91.0047","volume":"10","author":"CC Elgot","year":"1965","unstructured":"Elgot, C.C., Mezei, J.E.: On relations defined by generalized finite automata. IBM J. 10, 47\u201368 (1965)","journal-title":"IBM J."},{"issue":"2","key":"10_CR5","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1145\/371316.371512","volume":"2","author":"J Engelfriet","year":"2001","unstructured":"Engelfriet, J., Hoogeboom, H.: MSO definable string transductions and two-way finite-state transducers. ACM Trans. Comput. Log. 2(2), 216\u2013254 (2001)","journal-title":"ACM Trans. Comput. Log."},{"issue":"1","key":"10_CR6","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/S0022-0000(68)80006-6","volume":"2","author":"PC Fischer","year":"1968","unstructured":"Fischer, P.C., Rosenberg, A.L.: Multitape one-way nonwriting automata. J. Comput. Syst. Sci. 2(1), 88\u2013101 (1968)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR7","unstructured":"Guillon, B.: Sweeping weakens two-way transducers even with a unary output alphabet. In: Proceedings of Seventh Workshop on NCMA 2015, Porto, Portugal, August 31 \u2013 September 1, 2015, pp. 91\u2013108 (2015)"},{"issue":"2","key":"10_CR8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M Rabin","year":"1959","unstructured":"Rabin, M., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev. 3(2), 125\u2013144 (1959)","journal-title":"IBM J. Res. Dev."},{"key":"10_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139195218","volume-title":"Elements of Automata Theory","author":"J Sakarovitch","year":"2009","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, New York (2009)"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Sakoda, W.J., Sipser, M.: Nondeterminism and the size of two way finite automata. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1\u20133 May 1978, San Diego, California, USA, pp. 275\u2013286 (1978)","DOI":"10.1145\/800133.804357"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Sipser, M.: Lower bounds on the size of sweeping automata. In: Proceedings of the 11th Annual ACM Symposium on Theory of Computing, April 30 \u2013 May 2, 1979, Atlanta, Georgia, USA, pp. 360\u2013364 (1979)","DOI":"10.1145\/800135.804429"}],"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-662-53132-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T14:45:56Z","timestamp":1498315556000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53132-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531310","9783662531327"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53132-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}