{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:47:56Z","timestamp":1725662876326},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540108542"},{"type":"electronic","value":"9783540387657"}],"license":[{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"content-version":"tdm","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":[[1981]]},"DOI":"10.1007\/3-540-10854-8_26","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T12:30:42Z","timestamp":1330173042000},"page":"234-243","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Rational cone and substitution"],"prefix":"10.1007","author":[{"given":"Jeannine","family":"Leguy","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,28]]},"reference":[{"key":"26_CR1","unstructured":"J. BEAUQUIER, \u2014 A remark about a substitution property (1978). To appear in Math. Syst. Theory."},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"J. BERSTEL, \u2014\u201cTransductions and context-free languages\u201d, Teubner Verlag, 1978.","DOI":"10.1007\/978-3-663-09367-1"},{"key":"26_CR3","first-page":"180","volume":"2","author":"L. Boasson","year":"1973","unstructured":"L. BOASSON and M. NIVAT, \u2014 Sur diverses familles de languages ferm\u00e9es par transductions rationnelles. Acta Informatica, 2 (1973) 180\u2013188.","journal-title":"Acta Informatica"},{"key":"26_CR4","first-page":"47","volume":"9","author":"C.C. Elgot","year":"1965","unstructured":"C.C. ELGOT et J.F. MEZEI, \u2014 On relations d\u00e9fined by generalized finite automata. I.B.M. J. Res. Dev. vol 9, (1965) 47\u201368.","journal-title":"I.B.M. J. Res. Dev."},{"key":"26_CR5","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/S0022-0000(72)80039-4","volume":"6","author":"S.A. Greibach","year":"1972","unstructured":"S.A. GREIBACH, \u2014 Syntaxtic operators on full semi-AFLS. J. Comp. Syst. Sc. 6 (1972), 30\u201376.","journal-title":"J. Comp. Syst. Sc."},{"key":"26_CR6","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0019-9958(75)80002-7","volume":"29","author":"S.A. Greibach","year":"1975","unstructured":"S.A. GREIBACH, \u2014 Erasing in context-free languages. Information and Control, 29, (1975), 301\u2013326.","journal-title":"Information and Control"},{"key":"26_CR7","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF00288769","volume":"13","author":"M. Latteux","year":"1980","unstructured":"M. LATTEUX, \u2014 Sur les g\u00e9n\u00e9rateurs Alg\u00e9briques et Lin\u00e9aires. Acta Informatica 13 (1980), 347\u2013363.","journal-title":"Acta Informatica"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"M. LATTEUX, \u2014 Quelques propri\u00e9t\u00e9s des langages \u00e0 un compteur, 5 th GI, conference. Lecture Notes in Computer Sciences 104, springer (1981) 52\u201363.","DOI":"10.1007\/BFb0017296"},{"key":"26_CR9","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0304-3975(81)90020-7","volume":"14","author":"M. Latteux","year":"1981","unstructured":"M. LATTEUX, \u2014 A propos du lemme de substitution, Theoretical Computer Science, 14 (1981), 119\u2013123.","journal-title":"Theoretical Computer Science"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"J. LEGUY, \u2014 Transductions Rationnelles D\u00e9croissantes (1979), R.A.I.R.O. Informatique Th\u00e9orique, Vol. 5, no 2, (1981).","DOI":"10.1051\/ita\/1981150201411"},{"key":"26_CR11","volume-title":"Transductions rationnelles d\u00e9croissantes et substitution","author":"J. Leguy","year":"1980","unstructured":"J. LEGUY, \u2014 Transductions rationnelles d\u00e9croissantes et substitution. Th\u00e8se 3e cycle, Universit\u00e9 de Lille I, Lille 1980."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10854-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:54:02Z","timestamp":1558256042000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10854-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540108542","9783540387657"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-10854-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]},"assertion":[{"value":"28 July 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}