{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T23:03:06Z","timestamp":1768258986464,"version":"3.49.0"},"reference-count":30,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":10424,"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":[[1985]]},"DOI":"10.1016\/0304-3975(85)90092-1","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"217-243","source":"Crossref","is-referenced-by-count":8,"special_numbering":"C","title":["Applications of scheduling theory to formal language theory"],"prefix":"10.1016","volume":"37","author":[{"given":"Jakob","family":"Gonczarowski","sequence":"first","affiliation":[]},{"given":"Manfred K.","family":"Warmuth","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(85)90092-1_BIB1","series-title":"NATO Conference","article-title":"Deterministic and stochastic scheduling problems with tree-like precedence constraints","author":"Bruno","year":"1981"},{"key":"10.1016\/0304-3975(85)90092-1_BIB2","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(85)90092-1_BIB3","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/BF00288685","article-title":"Optimal scheduling for two-processors systems","volume":"1","author":"Coffman","year":"1972","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(85)90092-1_BIB4","series-title":"Concerning two-adjacent context-free languages","author":"Dahlhaus","year":"1985"},{"key":"10.1016\/0304-3975(85)90092-1_BIB5","doi-asserted-by":"crossref","unstructured":"D. Dolev and M.K. Warmuth, Scheduling flat graphs, SICOMP, to appear.","DOI":"10.1137\/0214047"},{"key":"10.1016\/0304-3975(85)90092-1_BIB6","doi-asserted-by":"crossref","unstructured":"D. Dolev and M.K. Warmuth, Profile scheduling of opposing forests and level orders, SIAM J. Algebraic Discrete Methods, to appear.","DOI":"10.1137\/0606066"},{"key":"10.1016\/0304-3975(85)90092-1_BIB7","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/0196-6774(84)90039-7","article-title":"Scheduling precedence graphs of bounded height","volume":"5","author":"Dolev","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(85)90092-1_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"},{"issue":"4","key":"10.1016\/0304-3975(85)90092-1_BIB9_1","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1137\/0117070","article-title":"Optimal sequencing of two equivalent processors","volume":"17","author":"Fujii","year":"1969","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0304-3975(85)90092-1_BIB9_2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1137\/0120018","article-title":"Erratum","volume":"20","author":"Fujii","year":"1971","journal-title":"SIAM J. Appl. Math."},{"issue":"3","key":"10.1016\/0304-3975(85)90092-1_BIB10","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1145\/322326.322335","article-title":"An almost linear algorithm for two processor scheduling","volume":"29","author":"Gabow","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(85)90092-1_BIB11","unstructured":"H.N. Gabow, University of Colorado at Boulder, Private communication, 1981."},{"issue":"1","key":"10.1016\/0304-3975(85)90092-1_BIB12","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1137\/0604011","article-title":"Scheduling opposing forests","volume":"4","author":"Garey","year":"1983","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0304-3975(85)90092-1_BIB13","doi-asserted-by":"crossref","unstructured":"J. Gonczarowski and E. Shamir, Pattern selector grammars and several parsing algorithms in the context-free style, J. Comput. System Sci., to appear.","DOI":"10.1016\/0022-0000(85)90046-7"},{"key":"10.1016\/0304-3975(85)90092-1_BIB14","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(86)90042-3","article-title":"Manipulating derivation forests by scheduling techniques","author":"Gonczarowski","year":"1985"},{"key":"10.1016\/0304-3975(85)90092-1_BIB15","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"issue":"6","key":"10.1016\/0304-3975(85)90092-1_BIB16","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(85)90092-1_BIB17","series-title":"Complexity of Computer Computations","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0304-3975(85)90092-1_BIB18","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(81)90097-9","article-title":"Context-free like restrictions on selective rewriting","volume":"16","author":"Kleijn","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90092-1_BIB19","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(85)90092-1_BIB20","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.26.1.22","article-title":"Complexity of scheduling under precendence constraints","volume":"26","author":"Lenstra","year":"1978","journal-title":"Oper. Res."},{"key":"10.1016\/0304-3975(85)90092-1_BIB21","article-title":"Well structured parallel programs are not easier to schedule","author":"Mayr","year":"1981"},{"key":"10.1016\/0304-3975(85)90092-1_BIB22","series-title":"Automata, Languages, Development","first-page":"243","article-title":"Time complexity of recognition and parsing of E0L languages","author":"Opartny","year":"1976"},{"issue":"3","key":"10.1016\/0304-3975(85)90092-1_BIB23","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1137\/0208031","article-title":"Scheduling interval-ordered tasks","volume":"10","author":"Papadimitriou","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(85)90092-1_BIB24","series-title":"The Mathematical Theory of L Systems","author":"Rozenberg","year":"1980"},{"key":"10.1016\/0304-3975(85)90092-1_BIB25","series-title":"Formal Languages","author":"Salomaa","year":"1973"},{"key":"10.1016\/0304-3975(85)90092-1_BIB26","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","article-title":"NP-complete scheduling problems","volume":"10","author":"Ullman","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(85)90092-1_BIB27","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(85)90092-1_BIB28","article-title":"Scheduling on profiles of constant breadth","author":"Warmuth","year":"1981"},{"key":"10.1016\/0304-3975(85)90092-1_BIB29","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. Control"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585900921?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585900921?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T08:52:43Z","timestamp":1553158363000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397585900921"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":30,"alternative-id":["0304397585900921"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90092-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}