{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T12:57:36Z","timestamp":1649163456821},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1976,1,1]],"date-time":"1976-01-01T00:00:00Z","timestamp":189302400000},"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":13712,"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":[[1976]]},"DOI":"10.1016\/0304-3975(76)90033-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"209-223","source":"Crossref","is-referenced-by-count":19,"title":["Langages algebriques, paires iterantes et transductions rationnelles"],"prefix":"10.1016","volume":"2","author":[{"given":"L.","family":"Boasson","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(76)90033-5_BIB1","unstructured":"J.M. Autebert, Le cylindre des langages \u00e0 compteur n'est pas principal, \u00e0 para\u012dtre."},{"key":"10.1016\/0304-3975(76)90033-5_BIB2","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/BF01762231","article-title":"Une hi\u00e9rarchie des parties rationnelles de N2","volume":"7","author":"Berstel","year":"1973","journal-title":"Math. System. Theory"},{"key":"10.1016\/0304-3975(76)90033-5_BIB3","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/S0022-0000(73)80036-4","article-title":"Two iteration theorems for some families of languages","volume":"7","author":"Boasson","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(76)90033-5_BIB4","article-title":"Paires it\u00e9rantes et langages alg\u00e9briques","volume":"7","author":"Boasson","year":"1974","journal-title":"Th\u00e8se de Doctorat d'Etat, Universit\u00e9 Paris"},{"key":"10.1016\/0304-3975(76)90033-5_BIB5","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0020-0190(74)90050-7","article-title":"The inclusion of the substitution\u2014Closure of linear and one-counter languages in the largest sub-AFL of the family of context-free languages is prope","volume":"2","author":"Boasson","year":"1973","journal-title":"Information Processing Lett."},{"key":"10.1016\/0304-3975(76)90033-5_BIB6","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/BF00264030","article-title":"Sur diverses families des langages ferm\u00e9es par transductions rationnelles","volume":"2","author":"Boasson","year":"1973","journal-title":"Acta Informat."},{"key":"10.1016\/0304-3975(76)90033-5_BIB7","unstructured":"L. Boasson et M. Nivat, Le cylindre des langages lin\u00e9aires n'est pas principal, \u00e0 para\u012dtre."},{"key":"10.1016\/0304-3975(76)90033-5_BIB8","first-page":"285","article-title":"Bounded Algol-like languages","volume":"113","author":"Ginsburg","year":"1966","journal-title":"Trans. Am. Math. Soc."},{"key":"10.1016\/0304-3975(76)90033-5_BIB9","series-title":"The Mathematical Theory of Context-Free Languages","author":"Ginsburg","year":"1966"},{"key":"10.1016\/0304-3975(76)90033-5_BIB10","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0304-3975(76)90004-9","article-title":"Some uniformly erasable families of languages","volume":"2","author":"Ginsburg","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(76)90033-5_BIB11","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":"Ann. Inst. Fourier"},{"key":"10.1016\/0304-3975(76)90033-5_BIB12","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF01694004","article-title":"A helpful result for proving inherent ambiguity","volume":"2","author":"Ogden","year":"1967","journal-title":"Math. System Theory"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900335?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900335?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:21:05Z","timestamp":1555125665000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397576900335"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1976]]}},"alternative-id":["0304397576900335"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(76)90033-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1976]]}}}