{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T04:03:02Z","timestamp":1648958582557},"reference-count":29,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1979,6,1]],"date-time":"1979-06-01T00:00:00Z","timestamp":297043200000},"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":12465,"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":[[1979,6]]},"DOI":"10.1016\/0304-3975(79)90015-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"293-323","source":"Crossref","is-referenced-by-count":17,"title":["Generateurs algebriques et systemes de paires iterantes"],"prefix":"10.1016","volume":"8","author":[{"given":"Joffroy","family":"Beauquier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(79)90015-X_BIB1","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF01768474","article-title":"Non-Principalit\u00e9 du Cylindre des langages \u00e0 compteur","volume":"11","author":"Autebert","year":"1977","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(79)90015-X_BIB2","first-page":"63","article-title":"Une caract\u00e9risation des g\u00e9n\u00e9rateurs standard","volume":"R1","author":"Autebert","year":"1974","journal-title":"R.A.I.R.O."},{"key":"10.1016\/0304-3975(79)90015-X_BIB3","first-page":"66","article-title":"G\u00e9n\u00e9rateurs alg\u00e9briques non-ambigus","author":"Beauquier","year":"1976","journal-title":"Automata, Languages and Programming"},{"key":"10.1016\/0304-3975(79)90015-X_BIB4","article-title":"Contribution \u00e0 l'\u00e9tude de la complexit\u00e9 structurelle des langages alg\u00e9briques","volume":"VII","author":"Beauquier","year":"1977"},{"key":"10.1016\/0304-3975(79)90015-X_BIB5","article-title":"Un g\u00e9n\u00e9rateur alg\u00e9brique inh\u00e9remment ambigu, \u00e0 para\u00eetre dans R.A.I.R.O.","author":"Beauquier","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(79)90015-X_BIB6","series-title":"Transductions and Context-free Languages","author":"Berstel","year":"1978"},{"key":"10.1016\/0304-3975(79)90015-X_BIB7","series-title":"Communication \u00e0 la \u201cTagung \u00fcber Automata und Formale Sprachen\u201d","article-title":"Une classe de langages g\u00e9n\u00e9rateurs de la famille des langages alg\u00e9briques","author":"Boasson","year":"1975"},{"key":"10.1016\/0304-3975(79)90015-X_BIB8","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0304-3975(76)90033-5","article-title":"Langages alg\u00e9briques, paires it\u00e9rantes et transductions rationnelles","volume":"2","author":"Boasson","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(79)90015-X_BIB9","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF00289506","article-title":"Familles de langages translatables et ferm\u00e9es par crochet","volume":"2","author":"Boasson","year":"1973","journal-title":"Acta Informat."},{"key":"10.1016\/0304-3975(79)90015-X_BIB10","article-title":"Rational cones and full AFL's","volume":"71","author":"Boasson","year":"1971","journal-title":"Communication \u00e0 Informatik"},{"key":"10.1016\/0304-3975(79)90015-X_BIB11","article-title":"Parenthesis generators","author":"Boasson","year":"1976","journal-title":"Foundations of Computer Sciences"},{"key":"10.1016\/0304-3975(79)90015-X_BIB12","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01768473","article-title":"Le cylindre des langages lin\u00e9aires","volume":"11","author":"Boasson","year":"1977","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(79)90015-X_BIB13","author":"Eilenberg","year":"1970","journal-title":"Communication au Congr\u00e9s International des math\u00e9maticiens"},{"key":"10.1016\/0304-3975(79)90015-X_BIB14","series-title":"The Mathematical Theory of CF-Languages","author":"Ginsburg","year":"1966"},{"key":"10.1016\/0304-3975(79)90015-X_BIB15","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\/0304-3975(79)90015-X_BIB16","first-page":"1","article-title":"Studies in abstract Families of Languages","volume":"87","author":"Ginsburg","year":"1969","journal-title":"Mem. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(79)90015-X_BIB17","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\/0304-3975(79)90015-X_BIB18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0022-0000(73)80047-9","article-title":"On AFL Generators for finitely encoded AFA","author":"Ginsburg","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(79)90015-X_BIB19","series-title":"Algebra\u00efc Theory of Automata","author":"Ginzburg","year":"1968"},{"key":"10.1016\/0304-3975(79)90015-X_BIB20","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":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(79)90015-X_BIB21","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/S0022-0000(72)80039-4","article-title":"Syntactic Operators on full semi-AFL's","volume":"6","author":"Greibach","year":"1972","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(79)90015-X_BIB22","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."},{"issue":"2","key":"10.1016\/0304-3975(79)90015-X_BIB23","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1137\/0203009","article-title":"Jump PDA's and hierarchy of deterministic context-free languages","volume":"3","author":"Greibach","year":"1974","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(79)90015-X_BIB24","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\/0304-3975(79)90015-X_BIB25","series-title":"Equations dans le Mono\u00efde Libre","author":"Lentin","year":"1973"},{"key":"10.1016\/0304-3975(79)90015-X_BIB26","first-page":"112","article-title":"Finite automata and representation of events","author":"Myhill","year":"1957","journal-title":"Wright Air Dev. Command, Technical Report"},{"key":"10.1016\/0304-3975(79)90015-X_BIB27","doi-asserted-by":"crossref","first-page":"339","DOI":"10.5802\/aif.287","article-title":"Transductions des langages de Chomsky","volume":"18","author":"Nivat","year":"1966","journal-title":"Ann. Inst. Fourier"},{"key":"10.1016\/0304-3975(79)90015-X_BIB28","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. Systems Theory"},{"key":"10.1016\/0304-3975(79)90015-X_BIB29","first-page":"197","article-title":"Sur un langage \u00e9quivalent au langage de Dyck","volume":"IV","author":"Schutzenberger","year":"1973"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439757990015X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439757990015X?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:23:34Z","timestamp":1555125814000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439757990015X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,6]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1979,6]]}},"alternative-id":["030439757990015X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(79)90015-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1979,6]]}}}