{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T17:19:39Z","timestamp":1767892779824,"version":"3.49.0"},"reference-count":16,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1973,12,1]],"date-time":"1973-12-01T00:00:00Z","timestamp":123552000000},"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":14473,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1973,12]]},"DOI":"10.1016\/s0022-0000(73)80036-4","type":"journal-article","created":{"date-parts":[[2008,1,3]],"date-time":"2008-01-03T10:37:03Z","timestamp":1199356623000},"page":"583-596","source":"Crossref","is-referenced-by-count":29,"title":["Two iteration theorems for some families of languages"],"prefix":"10.1016","volume":"7","author":[{"given":"L.","family":"Boasson","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(73)80036-4_bib1","series-title":"Third Annual ACM Symposium on Theory of Computing","first-page":"116","article-title":"An iteration theorem for one-counter languages","author":"Boasson","year":"1970"},{"key":"10.1016\/S0022-0000(73)80036-4_bib2","unstructured":"L. Boasson, Une caract\u00e9risation alg\u00e9brique des languages \u00e0 compteur (to appear)"},{"key":"10.1016\/S0022-0000(73)80036-4_bib3","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/BF00264030","article-title":"Sur les images par transductions de familles de langages","volume":"2","author":"Boasson","year":"1973","journal-title":"Acta Informatica"},{"key":"10.1016\/S0022-0000(73)80036-4_bib4","volume":"Vol. 1","author":"Clifford","year":"1961"},{"key":"10.1016\/S0022-0000(73)80036-4_bib5","first-page":"265","article-title":"Algebraic aspects of automata theory","volume":"3","author":"Eilenberg","year":"1971","journal-title":"Actes Congr. Intern. Math. Nice 1970"},{"key":"10.1016\/S0022-0000(73)80036-4_bib6","unstructured":"S. Eilenberg, Private communication."},{"key":"10.1016\/S0022-0000(73)80036-4_bib7","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0021-8693(69)90070-2","article-title":"Rational sets in commutative monoids","volume":"13","author":"Eilenberg","year":"1969","journal-title":"J. Algebra"},{"key":"10.1016\/S0022-0000(73)80036-4_bib8","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":"1962","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/S0022-0000(73)80036-4_bib9","author":"Ginsburg","year":"1966"},{"key":"10.1016\/S0022-0000(73)80036-4_bib10","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/S0022-0000(70)80016-2","article-title":"Principal AFL","volume":"4","author":"Ginsburg","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(73)80036-4_bib11","doi-asserted-by":"crossref","DOI":"10.1090\/memo\/0087","article-title":"Studies in Abstract Families of Languages","author":"Ginsburg","year":"1969"},{"key":"10.1016\/S0022-0000(73)80036-4_bib12","first-page":"285","article-title":"Bounded algol-like languages","volume":"113","author":"Ginsburg","year":"1966","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0022-0000(73)80036-4_bib13","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1145\/321495.321503","article-title":"An infinite hierachy of context free languages","volume":"16","author":"Greibach","year":"1969","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(73)80036-4_bib14","doi-asserted-by":"crossref","first-page":"339","DOI":"10.5802\/aif.287","article-title":"Transduction des languages de Chomsky","volume":"18","author":"Nivat","year":"1968","journal-title":"Ann. Inst. Fourier (Grenoble)"},{"issue":"Ser. A","key":"10.1016\/S0022-0000(73)80036-4_bib15","first-page":"824","article-title":"Une g\u00e9n\u00e9ralisation du mono\u00efde bicyclique","volume":"271","author":"Nivat","year":"1970","journal-title":"C. R. Acad. Sci. Paris"},{"key":"10.1016\/S0022-0000(73)80036-4_bib16","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF01694004","article-title":"An helpful result for proving inherent ambiguity","volume":"2","author":"Ogden","year":"1967","journal-title":"Math. Systems Theory"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000073800364?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000073800364?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T09:54:21Z","timestamp":1557136461000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000073800364"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1973,12]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1973,12]]}},"alternative-id":["S0022000073800364"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(73)80036-4","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1973,12]]}}}