{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T08:33:18Z","timestamp":1684398798131},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1980,4,1]],"date-time":"1980-04-01T00:00:00Z","timestamp":323395200000},"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":12160,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1980,4]]},"DOI":"10.1016\/0166-218x(80)90050-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:34Z","timestamp":1027640614000},"page":"1-20","source":"Crossref","is-referenced-by-count":17,"title":["Langages sur des alphabets infinis"],"prefix":"10.1016","volume":"2","author":[{"given":"Jean-Michel","family":"Autebert","sequence":"first","affiliation":[]},{"given":"Joffroy","family":"Beauquier","sequence":"additional","affiliation":[]},{"given":"Luc","family":"Boasson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(80)90050-5_BIB1","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1051\/ita\/1979130403631","article-title":"Quelques probl\u00e8mes ouverts en th\u00e9orie des langages alg\u00e9briques","volume":"13","author":"Autebert","year":"1979","journal-title":"RAIRO Informatique Th\u00e9orique"},{"key":"10.1016\/0166-218X(80)90050-5_BIB2","unstructured":"J.-M. Autebert, J. Beauquier et L. Boasson, Formes de langages et formes de grammaires, soumis au J. Comput. System Sci."},{"key":"10.1016\/0166-218X(80)90050-5_BIB3","unstructured":"J.-M. Autebert, J. Beauquier et L. Boasson, Limites de langages, en pr\u00e9paration."},{"key":"10.1016\/0166-218X(80)90050-5_BIB4","series-title":"Transductions and Context-free Languages","author":"Berstel","year":"1979"},{"key":"10.1016\/0166-218X(80)90050-5_BIB5","unstructured":"L. Boasson et M. Nivat, Adherences of languages, \u00e0 para\u00eetre dans le J. Comput. System Sci."},{"key":"10.1016\/0166-218X(80)90050-5_BIB6","series-title":"Computer Programming and Formal Systems","first-page":"118","article-title":"The algebraic theory of context-free languages","author":"Chomsky","year":"1963"},{"key":"10.1016\/0166-218X(80)90050-5_BIB7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1051\/ita\/197509R100211","article-title":"Langages d'interpr\u00e9tation des sch\u00e9mes r\u00e9cursifs","volume":"9","author":"Cousineau","year":"1975","journal-title":"RAIRO Informatique Th\u00e9orique"},{"key":"10.1016\/0166-218X(80)90050-5_BIB8","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0022-0000(75)80051-1","article-title":"Context-free grammar forms","volume":"11","author":"Cremers","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0166-218X(80)90050-5_BIB9","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0022-0000(73)80040-6","article-title":"Program schemes, recursion schemes and formal languages","volume":"7","author":"Garland","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0166-218X(80)90050-5_BIB10","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF01691106","article-title":"Chains of full AFL's","volume":"4","author":"Greibach","year":"1970","journal-title":"Mathematical System Theory"},{"key":"10.1016\/0166-218X(80)90050-5_BIB11","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1137\/0202025","article-title":"The hardest context-free language","volume":"2","author":"Greibach","year":"1973","journal-title":"SIAM J. Computing"},{"key":"10.1016\/0166-218X(80)90050-5_BIB12","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0022-0000(77)80026-3","article-title":"Control sets on context-free grammar forms","volume":"15","author":"Greibach","year":"1977","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0166-218X(80)90050-5_BIB13","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1979"},{"key":"10.1016\/0166-218X(80)90050-5_BIB14","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1051\/ita\/1977110403111","article-title":"Mots infinis engendr\u00e9s par une grammaire alg\u00e9brique","volume":"11","author":"Nivat","year":"1977","journal-title":"RAIRO Informatique Th\u00e9orique"},{"key":"10.1016\/0166-218X(80)90050-5_BIB15","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1051\/ita\/1978120302591","article-title":"Sur les ensembles de mots infinis engendr\u00e9s par une grammaire alg\u00e9brique","volume":"12","author":"Nivat","year":"1978","journal-title":"RAIRO Informatique Th\u00e9orique"},{"key":"10.1016\/0166-218X(80)90050-5_BIB16","unstructured":"M. Nivat, On the synchronisation of processus, \u00e0 para\u00eetre."},{"key":"10.1016\/0166-218X(80)90050-5_BIB17","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":"Mathematical System Theory"},{"key":"10.1016\/0166-218X(80)90050-5_BIB18","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1145\/321356.321364","article-title":"On context-free languages","volume":"13","author":"Parikh","year":"1966","journal-title":"J. Assoc. of Computing Machinery"},{"key":"10.1016\/0166-218X(80)90050-5_BIB19","article-title":"Contribution \u00e0 l'\u00e9tude des \u00e9quivalences syntaxiques et transformations de programmes parall\u00e8les","volume":"VI","author":"Roucairol","year":"1978","journal-title":"Th\u00e8se d'Etat de l'Universit\u00e9 de Paris"},{"key":"10.1016\/0166-218X(80)90050-5_BIB20","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0019-9958(67)90529-3","article-title":"A representation theorem for algebraic and context-free power series in noncommutating variables","volume":"11","author":"Shamir","year":"1967","journal-title":"Information and Control"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X80900505?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X80900505?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T02:24:05Z","timestamp":1555122245000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X80900505"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,4]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1980,4]]}},"alternative-id":["0166218X80900505"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(80)90050-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1980,4]]}}}