{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T04:47:52Z","timestamp":1768279672203,"version":"3.49.0"},"reference-count":21,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1985,6,1]],"date-time":"1985-06-01T00:00:00Z","timestamp":486432000000},"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":10273,"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":[[1985,6]]},"DOI":"10.1016\/0022-0000(85)90046-7","type":"journal-article","created":{"date-parts":[[2003,12,3]],"date-time":"2003-12-03T11:59:35Z","timestamp":1070452775000},"page":"249-273","source":"Crossref","is-referenced-by-count":10,"title":["Pattern selector grammars and several parsing algorithms in the context-free style"],"prefix":"10.1016","volume":"30","author":[{"given":"J.","family":"Gonczarowski","sequence":"first","affiliation":[]},{"given":"E.","family":"Shamir","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(85)90046-7_BIB1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1080\/00207168108803261","article-title":"Time and space complexity of inside-out macro languages","volume":"10","author":"Asveld","year":"1981","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/0022-0000(85)90046-7_BIB2","series-title":"Proc. 2nd Colloq. Automata, Lang. Programming","first-page":"27","article-title":"Checking stacks and context-free programmed grammars accept P-complete languages","volume":"Vol. 14","author":"Beeri","year":"1974"},{"key":"10.1016\/0022-0000(85)90046-7_BIB3","unstructured":"E. Dahlhaus and H. Gaifman, private communication, Hebrew University of Jerusalem, 1985."},{"key":"10.1016\/0022-0000(85)90046-7_BIB4","article-title":"The Complexity of Languages Generated by Attribute Grammars","author":"Engelfriet","year":"1982"},{"key":"10.1016\/0022-0000(85)90046-7_BIB5","article-title":"Grammatical Constructions in Selective Substitution Grammars","author":"Gonczarowski","year":"1982"},{"key":"10.1016\/0022-0000(85)90046-7_BIB6","article-title":"Applications of Scheduling Theory to Formal Language Theory","author":"Gonczarowski","year":"1984"},{"key":"10.1016\/0022-0000(85)90046-7_BIB7","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0022-0000(85)90046-7_BIB8","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0022-0000(85)90046-7_BIB9","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0019-9958(77)90058-4","article-title":"Recognition of deterministic ETOL languages in logarithmic space","volume":"35","author":"Jones","year":"1977","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(85)90046-7_BIB10","series-title":"Proc. 4th Colloq. Automata, Lang. Programming","first-page":"301","article-title":"Complexity of some problems concerning L systems","volume":"Vol. 52","author":"Jones","year":"1977"},{"key":"10.1016\/0022-0000(85)90046-7_BIB11","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\/0022-0000(85)90046-7_BIB12","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0020-0190(75)90027-7","article-title":"The membership question for ETOL languages is polynomially complete","volume":"3","author":"Van Leeuwen","year":"1975","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(85)90046-7_BIB13","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0022-0000(75)80068-7","article-title":"The tape complexity of context-independent developmental languages","volume":"11","author":"Van Leeuwen","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(85)90046-7_BIB14","series-title":"Automata, Languages, Development","first-page":"243","article-title":"Time complexity of recognition and parsing of EOL languages","author":"Opatrny","year":"1976"},{"key":"10.1016\/0022-0000(85)90046-7_BIB15","series-title":"The Mathematical Theory of L Systems","author":"Rozenberg","year":"1979"},{"key":"10.1016\/0022-0000(85)90046-7_BIB16","series-title":"Formal Languages","author":"Salomaa","year":"1973"},{"key":"10.1016\/0022-0000(85)90046-7_BIB17","series-title":"Proc. 8th Annu. ACM Sympos. Theory of Computing","first-page":"141","article-title":"On the tape complexity of deterministic context-free languages","author":"Sudborough","year":"1976"},{"key":"10.1016\/0022-0000(85)90046-7_BIB18","series-title":"Proc. 4th Colloq. Automata, Lang. Programming","first-page":"509","article-title":"The time and tape complexity of developmental languages","volume":"Vol. 52","author":"Sudborough","year":"1977"},{"key":"10.1016\/0022-0000(85)90046-7_BIB19","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1080\/00207167708803138","article-title":"The complexity of the membership problem for some extensions of context-free languages","volume":"6","author":"Sudborough","year":"1977","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/0022-0000(85)90046-7_BIB20","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/S0022-0000(75)80046-8","article-title":"General context-free recognition in less than cubic time","volume":"10","author":"Valiant","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(85)90046-7_BIB21","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":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000085900467?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000085900467?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T15:53:57Z","timestamp":1550332437000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000085900467"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,6]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,6]]}},"alternative-id":["0022000085900467"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(85)90046-7","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1985,6]]}}}