{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:32:31Z","timestamp":1720200751712},"reference-count":23,"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)90226-9","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T03:31:32Z","timestamp":1060313492000},"page":"323-341","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Testing for grammatical coverings"],"prefix":"10.1016","volume":"38","author":[{"given":"D.J.","family":"Rosenkrantz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"III","given":"H.B.","family":"Hunt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(85)90226-9_BIB1_1","volume":"Vols. 1 and 2","author":"Aho","year":"1972"},{"key":"10.1016\/0304-3975(85)90226-9_BIB1_2","first-page":"493","volume":"Vols. 1 and 2","author":"Aho","year":"1973"},{"key":"10.1016\/0304-3975(85)90226-9_BIB2","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1145\/321906.321912","article-title":"An observation on relative parsing time","volume":"22","author":"Bertsch","year":"1975","journal-title":"J. Assoc. Computing Mach."},{"key":"10.1016\/0304-3975(85)90226-9_BIB3","series-title":"Proc. 3rd Ann. Princeton Conf. on Information Science and Systems","first-page":"345","article-title":"Ambiguity in graphs and expressions","author":"Book","year":"1969"},{"key":"10.1016\/0304-3975(85)90226-9_BIB4","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1137\/0207023","article-title":"Isomorphism testing for graphs, semigroups, and finite automata are polynomially equivalent problems","volume":"7","author":"Booth","year":"1978","journal-title":"SIAM J. Computing"},{"key":"10.1016\/0304-3975(85)90226-9_BIB5","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0022-0000(75)80051-1","article-title":"Context-free grammar forms","volume":"11","author":"Cremers","year":"1975","journal-title":"J. Computer and System Sciences"},{"key":"10.1016\/0304-3975(85)90226-9_BIB6","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/S0022-0000(77)80030-5","article-title":"The structure of context-free grammatical families","volume":"15","author":"Cremers","year":"1977","journal-title":"J. Computer and System Sciences"},{"key":"10.1016\/0304-3975(85)90226-9_BIB7","series-title":"Proc. IEEE 15th Annual Symp. on Switching and Automata Theory","first-page":"185","article-title":"Skeletal LR parsing","author":"Demers","year":"1974"},{"key":"10.1016\/0304-3975(85)90226-9_BIB8","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(85)90226-9_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0022-0000(67)80003-5","article-title":"Bracketed context-free languages","volume":"1","author":"Ginsburg","year":"1967","journal-title":"J. Computer and System Sciences"},{"key":"10.1016\/0304-3975(85)90226-9_BIB10","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF01776576","article-title":"On strict interpretations of grammar forms","volume":"12","author":"Ginsburg","year":"1979","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(85)90226-9_BIB11","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1145\/321724.321732","article-title":"On the covering and reduction problems for context-free grammars","volume":"19","author":"Gray","year":"1972","journal-title":"J. Assoc. Computing Mach."},{"key":"10.1016\/0304-3975(85)90226-9_BIB12","series-title":"Proc. Conf. on Theoretical Computer Science","first-page":"139","article-title":"Complexity of grammatical similarity relationships, Preliminary report","author":"Hunt","year":"1977"},{"key":"10.1016\/0304-3975(85)90226-9_BIB13","series-title":"Proc. 7th Ann. ACM Symp. on Principles of Programming Languages","first-page":"213","article-title":"Efficient algorithms for structural similarity of grammars","author":"Hunt","year":"1980"},{"key":"10.1016\/0304-3975(85)90226-9_BIB14","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/S0022-0000(76)80038-4","article-title":"On the equivalence, containment and covering problems for the regular and context-free languages","volume":"12","author":"Hunt","year":"1976","journal-title":"J. Computer and Systems Sciences"},{"key":"10.1016\/0304-3975(85)90226-9_BIB15","series-title":"Conf. Rec. 3rd ACM Symp. On Principles of Programming Languages","first-page":"1","article-title":"The influence of productions on derivations and parsing","author":"Leong","year":"1976"},{"key":"10.1016\/0304-3975(85)90226-9_BIB16","series-title":"Compiler Design Theory","author":"Lewis","year":"1976"},{"key":"10.1016\/0304-3975(85)90226-9_BIB17","article-title":"Context-free grammars: Covers, normal forms, and parsing","volume":"93","author":"Nijholt","year":"1980"},{"key":"10.1016\/0304-3975(85)90226-9_BIB18","series-title":"Grammatical coverings","author":"Reynolds","year":"1970"},{"key":"10.1016\/0304-3975(85)90226-9_BIB19","unstructured":"D.J. Rosenkrantz and H.B. Hunt, III, Efficient algorithms for automatic construction and compactification of parsing grammars, Submitted for publication."},{"key":"10.1016\/0304-3975(85)90226-9_BIB20","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1016\/S0019-9958(69)90072-2","article-title":"Transformational classes of grammars","volume":"14","author":"Schnorr","year":"1969","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(85)90226-9_BIB21","series-title":"Currents in the Theory of Computing","first-page":"143","article-title":"Tree automata: An informal survey","author":"Thatcher","year":"1973"},{"key":"10.1016\/0304-3975(85)90226-9_BIB22","article-title":"Grammar and L forms: An introduction","volume":"91","author":"Wood","year":"1980"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585902269?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585902269?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T20:00:13Z","timestamp":1552593613000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397585902269"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":23,"alternative-id":["0304397585902269"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90226-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}