乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,5]],"date-time":"2024-05-05T02:17:20Z","timestamp":1714875440622},"reference-count":26,"publisher":"Elsevier","isbn-type":[{"value":"9780127082400","type":"print"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1016\/b978-0-12-708240-0.50009-5","type":"book-chapter","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T05:32:43Z","timestamp":1404192763000},"page":"101-132","source":"Crossref","is-referenced-by-count":1,"title":["The Complexity of Structural Containment and Equivalence"],"prefix":"10.1016","author":[{"given":"D.J.","family":"Rosenkrantz","sequence":"first","affiliation":[]},{"suffix":"III","given":"H.B.","family":"Hunt","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/B978-0-12-708240-0.50009-5_bib1","volume":"I","author":"Aho","year":"1972"},{"key":"10.1016\/B978-0-12-708240-0.50009-5_bib2","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\/B978-0-12-708240-0.50009-5_bib3","series-title":"The Mathematical Theory of Context-Free Languages","author":"Ginsburg","year":"1966"},{"key":"10.1016\/B978-0-12-708240-0.50009-5_bib4","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. Comput. Syst. Sci."},{"key":"10.1016\/B978-0-12-708240-0.50009-5_bib5","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\/B978-0-12-708240-0.50009-5_bib6","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\/B978-0-12-708240-0.50009-5_bib7","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/0022-0000(79)90002-3","article-title":"Observations on the complexity of regular expression problems","volume":"19","author":"Hunt","year":"1979","journal-title":"J. Comp. Syst. Sci."},{"key":"10.1016\/B978-0-12-708240-0.50009-5_bib8","unstructured":"H.B. Hunt, III, and D.J. Rosenkrantz, Complexity of grammatical similarity relations\u2013preliminary report, Proc. Conf. Theoretical Computer Science, Waterloo, Canada (1977) 139\u2013145."},{"key":"10.1016\/B978-0-12-708240-0.50009-5_bib9","doi-asserted-by":"crossref","unstructured":"H.B. Hunt, III and D.J. Rosenkrantz, Efficient algorithms for structural similarity of grammars, Proc. 7th Ann. ACM Symp. on Principles of Programming Languages, Las Vegas, NV (1980) 213\u2013219","DOI":"10.1145\/567446.567467"},{"key":"10.1016\/B978-0-12-708240-0.50009-5_bib10","unstructured":"H.B. Hunt, III and D.J. Rosenkrantz, On structural similarity relations for hierarchical descriptions, in preparation."},{"key":"10.1016\/B978-0-12-708240-0.50009-5_bib11","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. Comput. Syst. Sci."},{"key":"10.1016\/B978-0-12-708240-0.50009-5_bib12","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\/B978-0-12-708240-0.50009-5_bib13","series-title":"Compiler Design Theory","author":"Lewis","year":"1976"},{"key":"10.1016\/B978-0-12-708240-0.50009-5_bib14","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\/B978-0-12-708240-0.50009-5_bib15","series-title":"Introduction to VLSI Systems","author":"Mead","year":"1980"},{"key":"10.1016\/B978-0-12-708240-0.50009-5_bib16","doi-asserted-by":"crossref","unstructured":"A.R. Meyer and L.J. Stockmeyer, The equivalence problem for regular expressions with squaring requires exponential space, Proc. 13th Ann. IEEE Symp. on Switching and Automata Theory (1972) 125\u2013129.","DOI":"10.1109\/SWAT.1972.29"},{"key":"10.1016\/B978-0-12-708240-0.50009-5_bib17","series-title":"Context-free grammars: Covers, normal forms, and parsing","author":"Nijholt","year":"1980"},{"key":"10.1016\/B978-0-12-708240-0.50009-5_bib18","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\/B978-0-12-708240-0.50009-5_bib19","series-title":"Grammatical coverings","author":"Reynolds","year":"1970"},{"key":"10.1016\/B978-0-12-708240-0.50009-5_bib20","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0304-3975(85)90226-9","article-title":"Testing for grammatical coverings","volume":"38","author":"Rosenkrantz","year":"1985","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/B978-0-12-708240-0.50009-5_bib21","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1145\/29873.29876","article-title":"Efficient algorithms for automatic construction and compactification of parsing grammars","volume":"9","author":"Rosenkrantz","year":"1987","journal-title":"ACM Trans. Programming Language and Systems"},{"key":"10.1016\/B978-0-12-708240-0.50009-5_bib22","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1145\/322047.322060","article-title":"Satisfiability is quasi-linear complete in NQL","volume":"25","author":"Schnorr","year":"1978","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/B978-0-12-708240-0.50009-5_bib23","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1137\/0214044","article-title":"On the equivalence and containment problems for unambiguous regular expressions, grammars and automata","volume":"14","author":"Stearns","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/B978-0-12-708240-0.50009-5_bib24","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF02090776","article-title":"Power indices and easier hard problems","volume":"23","author":"Stearns","year":"1990","journal-title":"Math. Systems Theory"},{"key":"10.1016\/B978-0-12-708240-0.50009-5_bib25","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\/B978-0-12-708240-0.50009-5_bib26","volume":"Volume 1","author":"Ullman","year":"1988"}],"container-title":["Theoretical Studies in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780127082400500095?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780127082400500095?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T06:11:17Z","timestamp":1565590277000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780127082400500095"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9780127082400"],"references-count":26,"URL":"https:\/\/doi.org\/10.1016\/b978-0-12-708240-0.50009-5","relation":{},"subject":[],"published":{"date-parts":[[1992]]}}}