{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:37:42Z","timestamp":1720201062682},"reference-count":26,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"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":10059,"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":[[1986]]},"DOI":"10.1016\/0304-3975(86)90042-3","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T10:09:04Z","timestamp":1051265344000},"page":"87-119","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["Manipulating derivation forests by scheduling techniques"],"prefix":"10.1016","volume":"45","author":[{"given":"Jakob","family":"Gonczarowski","sequence":"first","affiliation":[]},{"given":"Manfred K.","family":"Warmuth","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(86)90042-3_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(86)90042-3_BIB2","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF00289076","article-title":"On the complexity of formal grammars","volume":"9","author":"Book","year":"1978","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(86)90042-3_BIB3","series-title":"Proc. NATO Conference","article-title":"Deterministic and stochastic scheduling problems with treelike precedence constraints","author":"Bruno","year":"1981"},{"key":"10.1016\/0304-3975(86)90042-3_BIB4","series-title":"Proc. 2nd Coll. on Automata, Languages and Programming","first-page":"27","article-title":"Checking stacks and context-free programmed grammars accept P-complete languages","volume":"14","author":"Beeri","year":"1974"},{"key":"10.1016\/0304-3975(86)90042-3_BIB5","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(85)90069-6","article-title":"Concerning two-adjacent context-free languages","volume":"41","author":"Dahlhaus","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(86)90042-3_BIB6","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1137\/0214047","article-title":"Scheduling flat graphs","volume":"14","author":"Dolev","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(86)90042-3_BIB7","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1137\/0606066","article-title":"Profile scheduling of opposing forests and level orders","volume":"6","author":"Dolev","year":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0304-3975(86)90042-3_BIB8","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1145\/362007.362035","article-title":"An efficient context-free parsing algorithm","volume":"13","author":"Earley","year":"1970","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(86)90042-3_BIB9","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/S0022-0000(69)80015-2","article-title":"Scattered context grammars","volume":"3","author":"Greibach","year":"1969","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0304-3975(86)90042-3_BIB10_1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1080\/00207168308803374","article-title":"Closure properties of selective substitution grammars, Part I and II","volume":"14","author":"Gonczarowski","year":"1983","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/0304-3975(86)90042-3_BIB10_2","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1080\/00207168308803379","article-title":"Closure properties of selective substitution grammars, Part I and II","volume":"14","author":"Gonczarowski","year":"1983","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/0304-3975(86)90042-3_BIB11","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0022-0000(85)90046-7","article-title":"Pattern selector grammars and several parsing algorithms in the context-free style","volume":"30","author":"Gonczarowski","year":"1985","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0304-3975(86)90042-3_BIB12","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(85)90092-1","article-title":"Applications of scheduling theory to formal language theory","volume":"37","author":"Gonczarowski","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(86)90042-3_BIB13","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0304-3975(86)90042-3_BIB14","series-title":"Formal Languages and Their Relation to Automata","author":"Hopcroft","year":"1969"},{"issue":"6","key":"10.1016\/0304-3975(86)90042-3_BIB15","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1287\/opre.9.6.841","article-title":"Parallel sequencing and assembly line problems","volume":"9","author":"Hu","year":"1961","journal-title":"Oper Res."},{"key":"10.1016\/0304-3975(86)90042-3_BIB16","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(81)90097-9","article-title":"Context-free like restriction on selective rewriting","volume":"16","author":"Kleijn","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(86)90042-3_BIB17","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/BF00264281","article-title":"On the generative power of regular pattern grammars","volume":"20","author":"Kleijn","year":"1983","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(86)90042-3_BIB18","series-title":"Automata, Languages, Development","first-page":"243","article-title":"Time complexity of recognition and parsing of E0L Languages","author":"Opatrny","year":"1976"},{"key":"10.1016\/0304-3975(86)90042-3_BIB19","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0019-9958(74)91049-3","article-title":"One-sided and two-sided context in formal grammars","volume":"25","author":"Penttonen","year":"1974","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(86)90042-3_BIB20","first-page":"455","article-title":"Selective substitution grammars, Part I,","volume":"13","author":"Rozenberg","year":"1977","journal-title":"Elektron. Informationsverar. Kybernet."},{"key":"10.1016\/0304-3975(86)90042-3_BIB21","series-title":"The Mathematical Theory of L-Systems","author":"Rozenberg","year":"1980"},{"key":"10.1016\/0304-3975(86)90042-3_BIB22","series-title":"Formal Languages","author":"Salomaa","year":"1973"},{"key":"10.1016\/0304-3975(86)90042-3_BIB23","series-title":"Proc. 4th Internat. Coll. on Automata, Languages and Programming","first-page":"509","article-title":"The time and tape complexity of developmental languages","volume":"52","author":"Sudborough","year":"1977"},{"key":"10.1016\/0304-3975(86)90042-3_BIB24","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0020-0190(75)90027-7","article-title":"The membership question for ET0L languages is polynomially complete","volume":"3","author":"van Leeuwen","year":"1975","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(86)90042-3_BIB25","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0019-9958(67)80007-X","article-title":"Recognition and parsing of context-free languages in time n3","volume":"10","author":"Younger","year":"1967","journal-title":"Inform. and Control"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900423?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900423?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T20:53:38Z","timestamp":1553201618000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397586900423"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":26,"alternative-id":["0304397586900423"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(86)90042-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1986]]}}}