乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:17:14Z","timestamp":1725455834894},"publisher-location":"Berlin\/Heidelberg","reference-count":33,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354010576X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0017296","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T02:22:34Z","timestamp":1132626154000},"page":"52-63","source":"Crossref","is-referenced-by-count":3,"title":["Quelques proprietes des langages a un Compteur"],"prefix":"10.1007","author":[{"given":"Michel","family":"Latteux","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF01768474","volume":"11","author":"J.M. Autebert","year":"1977","unstructured":"J.M. AUTEBERT, \u201cNon-principalit\u00e9 du cylindre des langages \u00e0 compteur\u201d, Math. Systems Theory 11 (1977), 157\u2013167.","journal-title":"Math. Systems Theory"},{"key":"8_CR2","unstructured":"J. BEAUQUIER, \u201cContribution \u00e0 l'\u00e9tude de la complexit\u00e9 structurelle des langages alg\u00e9briques\u201d, Th\u00e8se Sc. Math., Paris, 1977."},{"key":"8_CR3","first-page":"45","volume-title":"Fundamental of computation theory","author":"J. Beauquier","year":"1979","unstructured":"J. BEAUQUIER, \u201cInd\u00e9pendance of linear and one-counter generators\u201d, Fundamental of computation theory, Akademie-Verlag, Berlin, 1979, 45\u201351."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"J. BERSTEL, \u201cTransductions and context-free languages\u201d, Teubner Verlag 1979.","DOI":"10.1007\/978-3-663-09367-1"},{"key":"8_CR5","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/3-540-06841-4_76","volume":"14","author":"J. Berstel","year":"1974","unstructured":"J. BERSTEL et L. BOASSON, \u201cUne suite d\u00e9croissante de c\u00f4nes rationnels\u201d, in Automata Languages and Programming, Loeckx (Ed.), Lecture Notes in Computer Science 14 (1974), 383\u2013397.","journal-title":"Lecture Notes in Computer Science"},{"key":"8_CR6","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/S0022-0000(73)80036-4","volume":"7","author":"L. Boasson","year":"1973","unstructured":"L. BOASSON, \u201cTwo iteration theorems for some families of languages\u201d, J. of Comput. and Syst. Sciences 7 (1973), 583\u2013596.","journal-title":"J. of Comput. and Syst. Sciences"},{"key":"8_CR7","first-page":"180","volume":"2","author":"L. Boasson","year":"1973","unstructured":"L. BOASSON et M. NIVAT, \u201cSur diverses familles de languages ferm\u00e9es par transductions rationnelles\u201d, Acta Informatica 2 (1973), 180\u2013188.","journal-title":"Acta Informatica"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/0022-0000(79)90004-7","volume":"19","author":"R. Book","year":"1979","unstructured":"R. BOOK, S. GREIBACH et C. WRATHALL, \u201cReset Machines\u201d, J. of Comput. and Syst. Sciences 19 (1979), 256\u2013276.","journal-title":"J. of Comput. and Syst. Sciences"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/0207016","volume":"7","author":"R. Book","year":"1978","unstructured":"R. BOOK et M. NIVAT, \u201cLinear languages and the intersection closures of classes of languages\u201d, SIAM J. Comput. 7 (1978), 167\u2013177.","journal-title":"SIAM J. Comput."},{"key":"8_CR10","volume-title":"\u201cAutomata languages and machines\u201d, vol. A","author":"S. Eilenberg","year":"1974","unstructured":"S. EILENBERG, \u201cAutomata languages and machines\u201d, vol. A, Academic Press, New York, 1974."},{"key":"8_CR11","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0022-0000(75)80038-9","volume":"10","author":"S. Ginsburg","year":"1975","unstructured":"S. GINSBURG, J. GOLDSTINE et S. GREIBACH, \u201cUniformly erasable AFL\u201d, J. of Comput. and Syst. Sciences 10 (1975), 165\u2013182.","journal-title":"J. of Comput. and Syst. Sciences"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0304-3975(76)90004-9","volume":"2","author":"S. Ginsburg","year":"1976","unstructured":"S. GINSBURG, J. GOLDSTINE et S. GREIBACH, \u201cSome uniformly erasable families of languages\u201d, Theoretical Computer Science 2 (1976), 29\u201344.","journal-title":"Theoretical Computer Science"},{"key":"8_CR13","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1145\/321495.321503","volume":"16","author":"S. Greibach","year":"1969","unstructured":"S. GREIBACH, \u201cAn infinite hierarchy of context-free languages\u201d, J. Assoc. Comput. Mach. 16 (1969), 91\u2013106.","journal-title":"J. Assoc. Comput. Mach."},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1137\/0202025","volume":"2","author":"S. Greibach","year":"1973","unstructured":"S. GREIBACH, \u201cThe hardest context-free language\u201d, SIAM J. Comput. 2 (1973), 304\u2013310.","journal-title":"SIAM J. Comput."},{"key":"8_CR15","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0022-0000(75)80042-0","volume":"10","author":"S. Greibach","year":"1975","unstructured":"S. GREIBACH, \u201cOne counter languages and the IRS condition\u201d, J. of Comput. and Syst. Sciences 10 (1975), 237\u2013247.","journal-title":"J. of Comput. and Syst. Sciences"},{"key":"8_CR16","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1051\/ita\/197509R200051","volume":"R2","author":"S. Greibach","year":"1975","unstructured":"S. GREIBACH, \u201cA note on the recognition of one counter languages\u201d, RAIRO Informatique th\u00e9orique R2 (1975), 5\u201312.","journal-title":"RAIRO Informatique th\u00e9orique"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(78)90020-8","volume":"7","author":"S. Greibach","year":"1978","unstructured":"S. GREIBACH, \u201cRemarks on blind and partially blind one-way multicounter machines\u201d, Theoretical Computer Science 7 (1978), 311\u2013324.","journal-title":"Theoretical Computer Science"},{"key":"8_CR18","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1051\/ita\/1979130201891","volume":"13","author":"S. Greibach","year":"1979","unstructured":"S. GREIBACH, \u201cOne counter languages and the chevron operation\u201d, RAIRO Informatique Th\u00e9orique 13 (1979), 189\u2013194.","journal-title":"RAIRO Informatique Th\u00e9orique"},{"key":"8_CR19","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1051\/ita\/1979130100191","volume":"13","author":"M. Jantzen","year":"1979","unstructured":"M. JANTZEN, \u201cOn the hierarchy of Petri Net Languages\u201d, RAIRO Informatique Th\u00e9orique 13 (1979), 19\u201330.","journal-title":"RAIRO Informatique Th\u00e9orique"},{"key":"8_CR20","unstructured":"M. JANTZEN, \u201cThe power of Synchronizing operations on strings\u201d, 1980, Publication de University of California at Santa Barbara."},{"key":"8_CR21","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1051\/ita\/1977110100291","volume":"11","author":"M. Latteux","year":"1977","unstructured":"M. LATTEUX, \u201cC\u00f4nes rationnels commutativement clos\u201d, RAIRO Informatique Th\u00e9orique 11 (1977), 29\u201351.","journal-title":"RAIRO Informatique Th\u00e9orique"},{"key":"8_CR22","unstructured":"M. LATTEUX, \u201cLangages \u00e0 un compteur\u201d, Publication IT-25-80, Lille 1980, soumis pour publication."},{"key":"8_CR23","unstructured":"M. LATTEUX, \u201cLangages commutatifs\u201d, Th\u00e8se Sc. Math., Lille, 1978."},{"key":"8_CR24","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0022-0000(79)90039-4","volume":"18","author":"M. Latteux","year":"1979","unstructured":"M. LATTEUX, \u201cC\u00f4nes rationnels commutatifs\u201d, J. of Comput. and Syst. Sciences, 18 (1979), 307\u2013333.","journal-title":"J. of Comput. and Syst. Sciences"},{"key":"8_CR25","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/BF00288769","volume":"13","author":"M. Latteux","year":"1980","unstructured":"M. LATTEUX, \u201cSur les g\u00e9n\u00e9rateurs alg\u00e9briques et lin\u00e9aires\u201d, Acta Informatica 13 (1980), 347\u2013363.","journal-title":"Acta Informatica"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"M. LATTEUX, \u201cA propos du lemme de substitution\u201d, 1980, \u00e0 para\u00eetre dans Theoretical Computer Science.","DOI":"10.1016\/0304-3975(81)90020-7"},{"key":"8_CR27","first-page":"255","volume-title":"Fundamental of Computation theory","author":"M. Latteux","year":"1979","unstructured":"M. LATTEUX et J. LEGUY, \u201cUne propri\u00e9t\u00e9 de la famille GRE\u201d, Fundamental of Computation theory, Adademie-Verlag, Berlin, 1979, 255\u2013261."},{"key":"8_CR28","unstructured":"J. LEGUY, \u201cTransductions rationnelles d\u00e9croissantes\u201d, 1979, \u00e0 para\u00eetre dans RAIRO Informatique th\u00e9orique."},{"key":"8_CR29","unstructured":"J. LEGUY, \u201cTransduction rationnelle d\u00e9croissante et substitution\u201d, 1980, Th\u00e8se, Lille."},{"key":"8_CR30","unstructured":"M. NIVAT, \u201cTransductions des languages de Chomsky\u201d, Th\u00e8se Sc. Math., Grenoble, 1967."},{"key":"8_CR31","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1016\/S0019-9958(69)90164-8","volume":"14","author":"A. Salomaa","year":"1969","unstructured":"A. SALOMAA, \u201cOn the index of a context-free grammar and language\u201d, Information and Control 14 (1969), 474\u2013477.","journal-title":"Information and Control"},{"key":"8_CR32","doi-asserted-by":"crossref","unstructured":"P. TURAKAINEN, \u201cOn some bounded semi AFLs and AFLs\u201d, 1980, \u00e0 para\u00eetre dans Information Sciences.","DOI":"10.1016\/0020-0255(81)90039-6"},{"key":"8_CR33","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1016\/S0019-9958(67)91032-7","volume":"10","author":"M.K. Yntema","year":"1967","unstructured":"M.K. YNTEMA, \u201cInclusion relations among families of context-free languages\u201d, Information and Control 10 (1967), 572\u2013597.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017296.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T16:38:06Z","timestamp":1607531886000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017296"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354010576X"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/bfb0017296","relation":{},"subject":[]}}