{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T19:12:38Z","timestamp":1693854758959},"reference-count":11,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1976,9,1]],"date-time":"1976-09-01T00:00:00Z","timestamp":210384000000},"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":13468,"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":[[1976,9]]},"DOI":"10.1016\/0304-3975(76)90088-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"361-382","source":"Crossref","is-referenced-by-count":9,"title":["The covering problem for linear context-free grammars"],"prefix":"10.1016","volume":"2","author":[{"suffix":"III","given":"H.B.","family":"Hunt","sequence":"first","affiliation":[]},{"given":"D.J.","family":"Rosenkrantz","sequence":"additional","affiliation":[]},{"given":"T.G.","family":"Szymanski","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(76)90088-8_BIB1","volume":"Vol. 1 and 2","author":"Aho","year":"1972"},{"key":"10.1016\/0304-3975(76)90088-8_BIB2","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. ACM"},{"key":"10.1016\/0304-3975(76)90088-8_BIB3","series-title":"Ph.D Thesis","article-title":"On the time and tape complexity of languages","author":"Hunt","year":"1973"},{"key":"10.1016\/0304-3975(76)90088-8_BIB4","first-page":"69","article-title":"Computational parallels between the regular and context free languages","author":"Hunt","year":"1974","journal-title":"Proceedings of the 6th Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(76)90088-8_BIB5","doi-asserted-by":"crossref","unstructured":"H.B. Hunt, III, D.J. Rosenkrantz and T.G. Szymanski, On the equivalence, containment and covering problems for the regular and context free languages, J. Comput System Sci., to appear.","DOI":"10.1016\/S0022-0000(76)80038-4"},{"key":"10.1016\/0304-3975(76)90088-8_BIB6","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/S0019-9958(67)90564-5","article-title":"A characterization of parenthesis languages","volume":"11","author":"Knuth","year":"1967","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(76)90088-8_BIB7","first-page":"36","article-title":"Simple deterministic languages","author":"Korenjak","year":"1966","journal-title":"IEEE Conf. Record of 7th Annual Symposium on Switching and Automata Theory"},{"key":"10.1016\/0304-3975(76)90088-8_BIB8","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/321406.321411","article-title":"Parenthesis grammars","volume":"14","author":"McNaughton","year":"1967","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(76)90088-8_BIB9","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/S0022-0000(68)80037-6","article-title":"Structural equivalence of context-free grammars","volume":"2","author":"Paull","year":"1968","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(76)90088-8_BIB10","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","article-title":"Relationships between nondeterministic and deterministic tape complexities","volume":"4","author":"Savitch","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(76)90088-8_BIB11","first-page":"1","article-title":"Word problems requiring exponential time","author":"Stockmeyer","year":"1973","journal-title":"Proceedings of the 5th Annual ACM Symposium on Theory of Computing"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900888?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900888?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:21:14Z","timestamp":1555111274000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397576900888"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,9]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1976,9]]}},"alternative-id":["0304397576900888"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(76)90088-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1976,9]]}}}