{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T17:19:53Z","timestamp":1688491193543},"reference-count":33,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1983,2,1]],"date-time":"1983-02-01T00:00:00Z","timestamp":412905600000},"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":11124,"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":[[1983,2]]},"DOI":"10.1016\/0022-0000(83)90018-1","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"14-33","source":"Crossref","is-referenced-by-count":9,"title":["Langages \u00e1 un Compteur"],"prefix":"10.1016","volume":"26","author":[{"given":"Michel","family":"Latteux","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(83)90018-1_BIB1","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF01768474","article-title":"Non-principalit\u00e9 du cylindre des langages a compteur","volume":"11","author":"Auterert","year":"1977","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0022-0000(83)90018-1_BIB2","article-title":"Contribution a l'\u00e9tude de la complexit\u00e9 structurelle des langages alg\u00e9briques","author":"Beauquier","year":"1977","journal-title":"Th\u00e9se Sc. Math."},{"key":"10.1016\/0022-0000(83)90018-1_BIB3","series-title":"Fundamentals of Computation Theory","first-page":"45","article-title":"Independence of linear and one-counter generators","author":"Beauquier","year":"1979"},{"key":"10.1016\/0022-0000(83)90018-1_BIB4","series-title":"Transductions and context-free languages","author":"Berstel","year":"1979"},{"key":"10.1016\/0022-0000(83)90018-1_BIB5","series-title":"Automata Languages and Programming","first-page":"383","article-title":"Une suite d\u00e9croissante de clines rationnels","author":"Berstel","year":"1974"},{"key":"10.1016\/0022-0000(83)90018-1_BIB6","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/S0022-0000(73)80036-4","article-title":"Two iteration theorems for some families of langages","volume":"7","author":"Boasson","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(83)90018-1_BIB7","first-page":"180","article-title":"Sur diverses familles de langages ferm\u00e9es par transductions rationnelles","volume":"2","author":"Boasson","year":"1973","journal-title":"Acta Inform."},{"key":"10.1016\/0022-0000(83)90018-1_BIB8","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/0022-0000(79)90004-7","article-title":"Reset machines","volume":"19","author":"Book","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(83)90018-1_BIB9","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/0207016","article-title":"Linear languages and the intersection closures of classes of languages","volume":"7","author":"Book","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(83)90018-1_BIB10","volume":"Vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0022-0000(83)90018-1_BIB11","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0022-0000(75)80038-9","article-title":"Uniformly erasable AFL","volume":"10","author":"Ginsburg","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(83)90018-1_BIB12","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\/0022-0000(83)90018-1_BIB13","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1145\/321495.321503","article-title":"An infinite hierarchy of context-free languages","volume":"16","author":"Greibach","year":"1969","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(83)90018-1_BIB14","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. Comput."},{"key":"10.1016\/0022-0000(83)90018-1_BIB15","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0022-0000(75)80042-0","article-title":"One-counter languages and the IRS condition","volume":"10","author":"Greibach","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(83)90018-1_BIB16","first-page":"5","article-title":"A note on the recognition of one-counter languages","volume":"R2","author":"Greibach","year":"1975","journal-title":"RAIRO Inform. Theor."},{"key":"10.1016\/0022-0000(83)90018-1_BIB17","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0304-3975(78)90020-8","article-title":"Remarks on blind and partially blind one-way multicounter machines","volume":"7","author":"Greibach","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(83)90018-1_BIB18","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1051\/ita\/1979130201891","article-title":"One-counter languages and the chevron operation","volume":"13","author":"Greibach","year":"1979","journal-title":"RAIRO Inform. Theor."},{"key":"10.1016\/0022-0000(83)90018-1_BIB19","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1051\/ita\/1979130100191","article-title":"On the hierarchy of Petri Net languages","volume":"13","author":"Jantzen","year":"1979","journal-title":"RAIRO Inform. Theor."},{"key":"10.1016\/0022-0000(83)90018-1_BIB20","series-title":"The Power of Synchronizing Operations on Strings","author":"Jantzen","year":"1980"},{"key":"10.1016\/0022-0000(83)90018-1_BIB21","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1051\/ita\/1977110100291","article-title":"C\u00f4nes rationnels commutativement clos","volume":"11","author":"Latteux","year":"1977","journal-title":"RAIRO Inform. Theor."},{"key":"10.1016\/0022-0000(83)90018-1_BIB22","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0304-3975(77)90003-2","article-title":"Produit dans le c\u00f4ne rationnel engendr\u00e9 par D1\u2217","volume":"5","author":"Latteux","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(83)90018-1_BIB23","article-title":"Langages Commutatifs","author":"Latteux","year":"1978"},{"key":"10.1016\/0022-0000(83)90018-1_BIB24","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0022-0000(79)90039-4","article-title":"C\u00f4nes rationnels commutatifs","volume":"18","author":"Latteux","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(83)90018-1_BIB25","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF00288769","article-title":"Sur les g\u00e9n\u00e9rateurs alg\u00e9briques et lin\u00e9aires","volume":"13","author":"Latteux","year":"1980","journal-title":"Acta Inform."},{"key":"10.1016\/0022-0000(83)90018-1_BIB26","article-title":"A propos du lemme de substitution","author":"Latteux","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(83)90018-1_BIB27","series-title":"Fundamentals of Computation Theory","first-page":"255","article-title":"Une propri\u00e9t\u00e9 de :la famille GRE","author":"Latteux","year":"1979"},{"key":"10.1016\/0022-0000(83)90018-1_BIB28","article-title":"Transductions rationnelles d\u00e9croissantes","author":"Leguy","year":"1979","journal-title":"RAIRO Inform. Theor."},{"key":"10.1016\/0022-0000(83)90018-1_BIB29","article-title":"Transduction rationnelle d\u00e9croissante et substitution","author":"Leguy","year":"1980"},{"key":"10.1016\/0022-0000(83)90018-1_BIB30","article-title":"Transductions des langages de Chomsky","author":"Nivat","year":"1967","journal-title":"Th\u00e9se Sc. Math."},{"key":"10.1016\/0022-0000(83)90018-1_BIB31","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1016\/S0019-9958(69)90164-8","article-title":"On the index of a context-free grammar and language","volume":"14","author":"Salomaa","year":"1969","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(83)90018-1_BIB32","article-title":"On some bounded semi AFLs and AFLs","author":"Turakainen","year":"1980","journal-title":"Inform. Sci."},{"key":"10.1016\/0022-0000(83)90018-1_BIB33","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1016\/S0019-9958(67)91032-7","article-title":"Inclusion relations among families of context-free languages","volume":"10","author":"Yntema","year":"1967","journal-title":"Inform. and Control"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"fr","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900181?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900181?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:50:39Z","timestamp":1550325039000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000083900181"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,2]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,2]]}},"alternative-id":["0022000083900181"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(83)90018-1","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1983,2]]}}}