{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T02:00:59Z","timestamp":1726452059723},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1979,1,1]],"date-time":"1979-01-01T00:00:00Z","timestamp":283996800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":12616,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1979]]},"DOI":"10.1016\/0304-3975(79)90049-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"261-263","source":"Crossref","is-referenced-by-count":14,"title":["A new proof of two theorems about rational transductions"],"prefix":"10.1016","volume":"8","author":[{"given":"Andr\u00e9","family":"Arnold","sequence":"first","affiliation":[]},{"given":"Michel","family":"Latteux","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"volume":"Vol. A","year":"1974","author":"Eilenberg","key":"10.1016\/0304-3975(79)90049-5_BIB1"},{"key":"10.1016\/0304-3975(79)90049-5_BIB2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1147\/rd.91.0047","article-title":"On relations defined by generalized finite automata","volume":"9","author":"Elgot","year":"1965","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0304-3975(79)90049-5_BIB3","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/0020-0190(78)90060-1","article-title":"On tree-transducers for partial functions","volume":"7","author":"Engelfriet","year":"1978","journal-title":"Information Processing Lett."},{"key":"10.1016\/0304-3975(79)90049-5_BIB4","doi-asserted-by":"crossref","first-page":"339","DOI":"10.5802\/aif.287","article-title":"Transductions des langages de Chomsky","volume":"18","author":"Nivat","year":"1968","journal-title":"Annales de l'Institut Fourier de Grenoble"},{"key":"10.1016\/0304-3975(79)90049-5_BIB5","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0304-3975(76)90026-8","article-title":"Sur les relations rationnelles entre mono\u00efdes libres","volume":"3","author":"Schutzenberger","year":"1976","journal-title":"Theor. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397579900495?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397579900495?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:23:17Z","timestamp":1555125797000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397579900495"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1979]]}},"alternative-id":["0304397579900495"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(79)90049-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1979]]}}}