乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T15:56:40Z","timestamp":1726847800533},"reference-count":33,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1976,4,1]],"date-time":"1976-04-01T00:00:00Z","timestamp":197164800000},"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":13621,"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":[[1976,4]]},"DOI":"10.1016\/s0022-0000(76)80038-4","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T04:46:40Z","timestamp":1289364400000},"page":"222-268","source":"Crossref","is-referenced-by-count":97,"title":["On the equivalence, containment, and covering problems for the regular and context-free languages"],"prefix":"10.1016","volume":"12","author":[{"suffix":"III","given":"Harry B.","family":"Hunt","sequence":"first","affiliation":[]},{"given":"Daniel J.","family":"Rosenkrantz","sequence":"additional","affiliation":[]},{"given":"Thomas G.","family":"Szymanski","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1974","author":"Aho","article-title":"The Design and Analysis of Computer Algorithms","key":"10.1016\/S0022-0000(76)80038-4_bib1"},{"volume":"Vol. I","year":"1972","author":"Aho","key":"10.1016\/S0022-0000(76)80038-4_bib2"},{"key":"10.1016\/S0022-0000(76)80038-4_bib3","series-title":"Proceedings of the 13th Annual IEEE Symposium on Switching and Automata Theory","first-page":"207","article-title":"Reversal-bounded multi-pushdown machines","author":"Baker","year":"1972"},{"key":"10.1016\/S0022-0000(76)80038-4_bib4","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0201019","article-title":"On languages accepted in polynomial time","volume":"1","author":"Book","year":"1972","journal-title":"SIAM J. Computing"},{"key":"10.1016\/S0022-0000(76)80038-4_bib5","series-title":"Proceedings of the Third Annual Princeton Conference on Information Sciences and Systems","first-page":"345","article-title":"Ambiguity in graphs and expressions","author":"Book","year":"1969"},{"key":"10.1016\/S0022-0000(76)80038-4_bib6","series-title":"Proceedings of the Eighth Annual IEEE Symposium on Switching and Automata Theory","first-page":"265","article-title":"On the star-height of regular events","author":"Cohen","year":"1967"},{"key":"10.1016\/S0022-0000(76)80038-4_bib7","series-title":"Proceedings of the Third Annual ACM Symposium on the Theory of Computing","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"year":"1966","author":"Ginsburg","article-title":"The Mathematical Theory of Context-Free Languages","key":"10.1016\/S0022-0000(76)80038-4_bib8"},{"key":"10.1016\/S0022-0000(76)80038-4_bib9","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1090\/S0002-9939-1966-0201310-3","article-title":"Bounded regular sets","volume":"17","author":"Ginsburg","year":"1966","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/S0022-0000(76)80038-4_bib10","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. Comput. Mach."},{"key":"10.1016\/S0022-0000(76)80038-4_bib11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01691341","article-title":"A note on undecidable properties of formal languages","volume":"2","author":"Greibach","year":"1968","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0022-0000(76)80038-4_bib12","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/BF01746517","article-title":"On the equivalence and containment problems for context-free languages","volume":"3","author":"Hopcroft","year":"1969","journal-title":"Math. Systems Theory"},{"year":"1969","author":"Hopcroft","key":"10.1016\/S0022-0000(76)80038-4_bib13"},{"key":"10.1016\/S0022-0000(76)80038-4_bib14","doi-asserted-by":"crossref","DOI":"10.1145\/800125.804030","article-title":"On the time and tape complexity of languages","author":"Hunt","year":"1973"},{"key":"10.1016\/S0022-0000(76)80038-4_bib15","series-title":"Proceedings of the Fifth Annual ACM Symposium on the Theory of Computing","first-page":"10","article-title":"On the time and tape complexity of languages, I","author":"Hunt","year":"1973"},{"key":"10.1016\/S0022-0000(76)80038-4_bib16","series-title":"Proceedings of the Sixth Annual. ACM Symposium on the Theory of Computing","first-page":"64","article-title":"Computational parallels between the regular and context-free languages","author":"Hunt","year":"1974"},{"unstructured":"H. B. Hunt III, D. J. Rosenkrantz, and T. G. Szymanski, The covering problem for linearcontext-free grammars, Theoret. Comput. Sci., to appear.","key":"10.1016\/S0022-0000(76)80038-4_bib17"},{"key":"10.1016\/S0022-0000(76)80038-4_bib18","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1145\/321724.321727","article-title":"A note concerning nondeterministic tape complexities","volume":"19","author":"Ibarra","year":"1972","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(76)80038-4_bib19","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":"Inform. Contr."},{"key":"10.1016\/S0022-0000(76)80038-4_bib20","series-title":"Proceedings of the Seventh Annual IEEE Symposium on Switching and Automata Theory","first-page":"36","article-title":"Simple deterministic languages","author":"Korenjak","year":"1966"},{"key":"10.1016\/S0022-0000(76)80038-4_bib21","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. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(76)80038-4_bib22","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/S0020-0255(69)80016-2","article-title":"The loop complexity of regulr events","volume":"1","author":"McNaughton","year":"1969","journal-title":"Inform. Sci."},{"year":"1971","author":"McNaughton","key":"10.1016\/S0022-0000(76)80038-4_bib23"},{"key":"10.1016\/S0022-0000(76)80038-4_bib24","series-title":"Proceedings of the 13th Annual IEEE Symposium on Switching and Automata Theory","first-page":"125","article-title":"The equivalence problem for regular expressions with squaring requires exponential space","author":"Meyer","year":"1972"},{"key":"10.1016\/S0022-0000(76)80038-4_bib25","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\/S0022-0000(76)80038-4_bib26","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/S0019-9958(70)90446-8","article-title":"Properties of deterministic top-down grammars","volume":"17","author":"Rosenkrantz","year":"1970","journal-title":"Inform. Contr."},{"key":"10.1016\/S0022-0000(76)80038-4_bib27","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\/S0022-0000(76)80038-4_bib28","series-title":"Proceedings of the 14th Annual IEEE Symposium on Switching and Automata Theory","first-page":"130","article-title":"Refinements of the nondeterministic time and space hierarchies","author":"Seiferas","year":"1973"},{"year":"1974","author":"Stockmeyer","article-title":"The complexity of decision problems in automata theory and logic","key":"10.1016\/S0022-0000(76)80038-4_bib29"},{"key":"10.1016\/S0022-0000(76)80038-4_bib30","series-title":"Proceedings of the Fifth Annual ACM Symposium on the Theory of Computing","first-page":"1","article-title":"Word problems requiring exponential time","author":"Stockmeyer","year":"1973"},{"unstructured":"A. Yehudai, private communication.","key":"10.1016\/S0022-0000(76)80038-4_bib31"},{"year":"1973","author":"Hunt","series-title":"On the time and tape complexity of languages, I","key":"10.1016\/S0022-0000(76)80038-4_bib32"},{"key":"10.1016\/S0022-0000(76)80038-4_bib33","series-title":"Proceedings of the Seventh Annual ACM Symposium on the Theory of Computing","first-page":"54","article-title":"On the complexity of grammar and related problems","author":"Hunt","year":"1975"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000076800384?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000076800384?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T01:11:17Z","timestamp":1559783477000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000076800384"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,4]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1976,4]]}},"alternative-id":["S0022000076800384"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(76)80038-4","relation":{},"ISSN":["0022-0000"],"issn-type":[{"type":"print","value":"0022-0000"}],"subject":[],"published":{"date-parts":[[1976,4]]}}}