乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,29]],"date-time":"2023-07-29T07:30:08Z","timestamp":1690615808166},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"2","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[1982,4]]},"DOI":"10.1145\/322307.322317","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T11:26:13Z","timestamp":1027769173000},"page":"429-447","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["On the Decidability of Grammar Problems"],"prefix":"10.1145","volume":"29","author":[{"suffix":"III","given":"H. B.","family":"Hunt","sequence":"first","affiliation":[{"name":"Department of Computer Science, State University of New York at Albany, 1400 Washington Avenue, Albany, NY"}]}],"member":"320","published-online":{"date-parts":[[1982,4]]},"reference":[{"key":"e_1_2_1_1_2","volume-title":"Vols. 1, 2","author":"AH","year":"1972","unstructured":"AH o, A.V., AND ULLMAN , J DThe Theory of Parsing, Translauon, and Compdmg , Vols. 1, 2 Prentice-Hall , Englewood Cliffs, N.J. , 1972 , 1973. AHo, A.V., AND ULLMAN, J DThe Theory of Parsing, Translauon, and Compdmg, Vols. 1, 2 Prentice-Hall, Englewood Cliffs, N.J., 1972, 1973."},{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/S0022-0000(73)80050-9","article-title":"grammars--An extension of LR(k) grammars","volume":"7","author":"CULIK K.","year":"1973","unstructured":"CULIK , K. II , m,lo Con E~ , R LR-regular grammars--An extension of LR(k) grammars . J. Comput. Syst. ScL 7 ( 1973 ), 66 - 96 . CULIK, K. II, m,lo ConE~, R LR-regular grammars--An extension of LR(k) grammars. J. Comput. Syst. ScL 7 (1973), 66-96.","journal-title":"J. Comput. Syst. ScL"},{"key":"e_1_2_1_3_2","first-page":"103","volume-title":"Conf. Rec 14th Ann. Symp. on Switching and Automata Theory","author":"GELL~R M M","year":"1973","unstructured":"GELL~R , M M ., Al CD HA g~soi% M.A. Characterizauons of LR(0) languages . Conf. Rec 14th Ann. Symp. on Switching and Automata Theory , Ames, Iowa , Oct. 1973 , pp. 103 - 108 GELL~R, M M., AlCD HAg~soi% M.A. Characterizauons of LR(0) languages. Conf. Rec 14th Ann. Symp. on Switching and Automata Theory, Ames, Iowa, Oct. 1973, pp. 103-108"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/321724.321732"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/321850.321851"},{"key":"e_1_2_1_6_2","first-page":"42","volume-title":"Proceedings of a Symposium on Applied Mathematics, Mathematical Aspects of Computer Science 19","author":"HARTMANIS J.","year":"1967","unstructured":"HARTMANIS , J. Context-free languages and Turmg machine computations . In Proceedings of a Symposium on Applied Mathematics, Mathematical Aspects of Computer Science 19 , American Mathemattcal Society, Prowdence, R.I. , 1967 , pp. 42 - 51 . HARTMANIS, J. Context-free languages and Turmg machine computations. In Proceedings of a Symposium on Applied Mathematics, Mathematical Aspects of Computer Science 19, American Mathemattcal Society, Prowdence, R.I., 1967, pp. 42-51."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/321650.321661"},{"key":"e_1_2_1_8_2","first-page":"333","article-title":"strict determimstie languages","volume":"1","author":"HAVEL I.M.","year":"1972","unstructured":"HAVEL , I.M. , AND HARRISON , M.A. Real-time strict determimstie languages , SlAM J. Comput. 1 ( 1972 ), 333 - 349 HAVEL, I.M., AND HARRISON, M.A.Real-time strict determimstie languages, SlAM J. Comput. 1 (1972), 333-349","journal-title":"SlAM J. Comput."},{"key":"e_1_2_1_9_2","volume-title":"Formal Languages and Thew Relation to Automata","author":"HOPCROFT J.E","year":"1969","unstructured":"HOPCROFT , J.E , AND ULL bIA N~ I . D. Formal Languages and Thew Relation to Automata . Addison- Wesley , Reading, Mass ., 1969 . HOPCROFT, J.E, AND ULLbIAN~ I.D. Formal Languages and Thew Relation to Automata. Addison- Wesley, Reading, Mass., 1969."},{"key":"e_1_2_1_10_2","volume-title":"texmmating Turing machine computations, and the complexity of correspondence problems, grammars, and program schemes. Unpubhshed manuscript","author":"HUNT H.B.","year":"1980","unstructured":"HUNT , H.B. III .Partial sot recognition problems , texmmating Turing machine computations, and the complexity of correspondence problems, grammars, and program schemes. Unpubhshed manuscript , 1980 . HUNT, H.B. III.Partial sot recognition problems, texmmating Turing machine computations, and the complexity of correspondence problems, grammars, and program schemes. Unpubhshed manuscript, 1980."},{"key":"e_1_2_1_11_2","first-page":"126","volume-title":"Pa.","author":"III Va, T","year":"1976","unstructured":"HtmT, H B. III , AND SZ~S Va, T .G.Dtchotomization, teachability , and the forbidden subgraph property Proc. 8th Ann. ACM Syrup. on Theory of Computing, Hershey , Pa. , May 1976 , pp. 126 - 134 . 10.1145\/800113.803640 HtmT, H B. III, AND SZ~SVa, T.G.Dtchotomization, teachability, and the forbidden subgraph property Proc. 8th Ann. ACM Syrup. on Theory of Computing, Hershey, Pa., May 1976, pp. 126- 134. 10.1145\/800113.803640"},{"key":"e_1_2_1_12_2","first-page":"318","article-title":"metatheorems for context-free grammar problems. ~ Comput","volume":"13","author":"HUNT H,B","year":"1976","unstructured":"HUNT , H,B . III , AND SZYMA NSKI , T.G.Complexity metatheorems for context-free grammar problems. ~ Comput . Syst. Sci. 13 ( 1976 ), 318 - 334 . HUNT, H,B. III, AND SZYMANSKI, T.G.Complexity metatheorems for context-free grammar problems. ~ Comput. Syst. Sci. 13 (1976), 318-334.","journal-title":"Syst. Sci."},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/322047.322051"},{"key":"e_1_2_1_14_2","first-page":"31","volume":"4","author":"JARZABEK S.","year":"1975","unstructured":"JARZABEK , S. , AND KILAWCZYK , T. LL -regular grammars Inf Proc . Lett. 4 ( 1975 ), 31 - 37 . JARZABEK, S., AND KILAWCZYK, T.LL-regular grammars Inf Proc. Lett. 4 (1975), 31-37.","journal-title":"Lett."},{"key":"e_1_2_1_15_2","volume-title":"Compiler Design Theory","author":"LE","year":"1976","unstructured":"LE wis, P.M. IL l, ROSENKRANTZ , D.J. , AND SamAg Ns, R . E. Compiler Design Theory . Addison-Wesley , Reading, Mass ., 1976 . LEwis, P.M. ILl, ROSENKRANTZ, D.J., AND SamAgNs, R.E. Compiler Design Theory. Addison-Wesley, Reading, Mass., 1976."},{"key":"e_1_2_1_16_2","doi-asserted-by":"crossref","unstructured":"MiCKtmAS M D.On the complete coveting problem for LR(k) grammars. ~ A CM 23 1 (Jan. 1976) 17-30. 10.1145\/321921.321924 MiCKtmAS M D.On the complete coveting problem for LR(k) grammars. ~ A CM 23 1 (Jan. 1976) 17-30. 10.1145\/321921.321924","DOI":"10.1145\/321921.321924"},{"key":"e_1_2_1_17_2","volume-title":"December","author":"OGDEN W.F.","year":"1971","unstructured":"OGDEN W.F. Unpublished memorandum , December 1971 . OGDEN W.F. Unpublished memorandum, December 1971."},{"key":"e_1_2_1_18_2","first-page":"427","article-title":"Structural equivalence of context=free grammars. ~ Comput","volume":"2","author":"PAULL M.C.","year":"1968","unstructured":"PAULL , M.C. , AND UNGER , S.H . Structural equivalence of context=free grammars. ~ Comput . Syst. Sci. 2 ( 1968 ), 427 -- 463 PAULL, M.C., AND UNGER, S.H. Structural equivalence of context=free grammars. ~ Comput. Syst. Sci. 2 (1968), 427--463","journal-title":"Syst. Sci."},{"key":"e_1_2_1_19_2","volume-title":"Grammatical coverings. Unpublished manuscript","author":"REYNOLDS J.C","year":"1970","unstructured":"REYNOLDS , J.C , AND HASK~LL , R. Grammatical coverings. Unpublished manuscript , 1970 . REYNOLDS, J.C, AND HASK~LL, R. Grammatical coverings. Unpublished manuscript, 1970."},{"key":"e_1_2_1_20_2","volume-title":"Dep. of Computer Science, Corner Umv, Ithaca, N.Y.","author":"SZYMANSKI T G","year":"1973","unstructured":"SZYMANSKI , T G . Generalized bottom-up parsing. Ph D. Dissertation , Dep. of Computer Science, Corner Umv, Ithaca, N.Y. , 1973 SZYMANSKI, T G. Generalized bottom-up parsing. Ph D. Dissertation, Dep. of Computer Science, Corner Umv, Ithaca, N.Y., 1973"},{"key":"e_1_2_1_21_2","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1137\/0205019","article-title":"extensions of bottom=up parsing techniques","volume":"5","author":"SZYMANS","year":"1976","unstructured":"SZYMANS ra, T.G., AND Wmu~s, LH .Noncanonical extensions of bottom=up parsing techniques . SIAM J. Comput. 5 ( 1976 ), 231 - 250 . SZYMANSra, T.G., AND Wmu~s, LH.Noncanonical extensions of bottom=up parsing techniques. SIAM J. Comput. 5 (1976), 231-250.","journal-title":"SIAM J. Comput."},{"key":"e_1_2_1_22_2","first-page":"143","article-title":"An mformal survey. La Currents in the Theory of Computing, A V. Allo, Ed., Prenuce-Hall, Englewood Cliffs","author":"THATCHER J W","year":"1973","unstructured":"THATCHER , J W .Tree automata : An mformal survey. La Currents in the Theory of Computing, A V. Allo, Ed., Prenuce-Hall, Englewood Cliffs , N.J. , 1973 , pp. 143 -- 172 . THATCHER, J W.Tree automata: An mformal survey. La Currents in the Theory of Computing, A V. Allo, Ed., Prenuce-Hall, Englewood Cliffs, N.J., 1973, pp. 143--172.","journal-title":"N.J."},{"key":"e_1_2_1_23_2","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0019-9958(76)90173-X","article-title":"note on the succinctness of descnptlons of determimsUc languages","volume":"32","author":"VALIANT L.G.","year":"1976","unstructured":"VALIANT , L.G. A note on the succinctness of descnptlons of determimsUc languages . Inf. Control 32 ( 1976 ), 139 - 145 . VALIANT, L.G.A note on the succinctness of descnptlons of determimsUc languages. Inf. Control 32 (1976), 139-145.","journal-title":"Inf. Control"}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/322307.322317","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T20:23:07Z","timestamp":1672518187000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/322307.322317"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,4]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982,4]]}},"alternative-id":["10.1145\/322307.322317"],"URL":"https:\/\/doi.org\/10.1145\/322307.322317","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"value":"0004-5411","type":"print"},{"value":"1557-735X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,4]]},"assertion":[{"value":"1982-04-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}