{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T01:29:28Z","timestamp":1720574968010},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"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":7533,"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":[[1992,12]]},"DOI":"10.1016\/0304-3975(92)90253-c","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"283-308","source":"Crossref","is-referenced-by-count":19,"title":["Complexity in left-associative grammar"],"prefix":"10.1016","volume":"106","author":[{"given":"Roland","family":"Hausser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90253-C_BIB1","first-page":"1","article-title":"Die syntaktische Konnexit\u00e4t","volume":"1","author":"Ajdukiewicz","year":"1935","journal-title":"Studia Philosophica"},{"key":"10.1016\/0304-3975(92)90253-C_BIB2","series-title":"Computational Complexity and Natural Language","author":"Barton","year":"1987"},{"key":"10.1016\/0304-3975(92)90253-C_BIB3","series-title":"The Grammatical Basis of Linguistic Performance: Language Use and Acquisition","author":"Berwick","year":"1984"},{"key":"10.1016\/0304-3975(92)90253-C_BIB4","year":"1980"},{"issue":"2","key":"10.1016\/0304-3975(92)90253-C_BIB5","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1145\/362007.362035","article-title":"An efficient context-free parsing algorithm","volume":"13","author":"Earley","year":"1970","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(92)90253-C_BIB6","series-title":"Computers and Intractibility","author":"Gary","year":"1979"},{"key":"10.1016\/0304-3975(92)90253-C_BIB7","series-title":"Formal Language Theory: Perspectives and Open Problems","first-page":"1","article-title":"Formal Language Theory: Methods for Specifying Families of Formal Languages \u2014 Past\u2014Present\u2014Future","author":"Ginsberg","year":"1980"},{"key":"10.1016\/0304-3975(92)90253-C_BIB8","first-page":"1","article-title":"Abstract families of languages","volume":"87","author":"Ginsberg","year":"1969","journal-title":"Mem. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(92)90253-C_BIB9","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1137\/0202025","article-title":"The hardest context-free language","volume":"2","author":"Greibach","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(92)90253-C_BIB10","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0304-3975(92)90253-C_BIB11","article-title":"NEWCAT: Parsing Natural Language Using Left-Associative Grammar","volume":"Vol. 231","author":"Hausser","year":"1986"},{"key":"10.1016\/0304-3975(92)90253-C_BIB12","series-title":"Computation of Language (Symbolic Computation\u2013Artificial Intelligence)","author":"Hausser","year":"1989"},{"issue":"1","key":"10.1016\/0304-3975(92)90253-C_BIB13","doi-asserted-by":"crossref","first-page":"61","DOI":"10.2977\/prims\/1195192738","article-title":"On derivative trees of indexed grammars \u2013 an extension of the uvwxy theorem","volume":"9","author":"Hayashi","year":"1973","journal-title":"Publications of the Research Institute for Mathematical Sciences"},{"key":"10.1016\/0304-3975(92)90253-C_BIB14","series-title":"Formal Languages and their Relation to Automata","author":"Hopcroft","year":"1969"},{"key":"10.1016\/0304-3975(92)90253-C_BIB15","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(92)90253-C_BIB16","series-title":"Mathematics of Language","article-title":"Intro to TAG","author":"Joshi","year":"1987"},{"key":"10.1016\/0304-3975(92)90253-C_BIB17","doi-asserted-by":"crossref","first-page":"181","DOI":"10.4064\/fm-14-1-1-81","article-title":"Grundz\u00fcge eines neuen systems der grundlage der mathematik","volume":"14","author":"Le\u015bniewski","year":"1929","journal-title":"Fund. Math."},{"key":"10.1016\/0304-3975(92)90253-C_BIB18","first-page":"483","article-title":"On the generative power of transformational grammer","volume":"18","author":"Peters","year":"1973","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(92)90253-C_BIB19","doi-asserted-by":"crossref","first-page":"103","DOI":"10.2307\/2269031","article-title":"Finite combinatory processes \u2014Formulation I","volume":"1","author":"Post","year":"1936","journal-title":"J. Symbolic Logic"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290253C?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290253C?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:21:07Z","timestamp":1555114867000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290253C"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["030439759290253C"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90253-c","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}