{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T07:50:25Z","timestamp":1715241025973},"reference-count":13,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"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":3699,"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":[[2003,6]]},"DOI":"10.1016\/s0304-3975(02)00853-8","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:53:40Z","timestamp":1051127620000},"page":"365-399","source":"Crossref","is-referenced-by-count":14,"title":["A recognition and parsing algorithm for arbitrary conjunctive grammars"],"prefix":"10.1016","volume":"302","author":[{"given":"Alexander","family":"Okhotin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0304-3975(02)00853-8_BIB1","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":"Commun. ACM"},{"issue":"2","key":"10.1016\/S0304-3975(02)00853-8_BIB2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/1008354.1008356","article-title":"The monotone and planar cirquit value problems are log space complete for P","volume":"9","author":"Goldschlager","year":"1977","journal-title":"SIGACT News"},{"key":"10.1016\/S0304-3975(02)00853-8_BIB3","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0065-2458(08)60451-9","article-title":"Parsing of general context-free languages","volume":"14","author":"Graham","year":"1976","journal-title":"Adv. in Com."},{"issue":"3","key":"10.1016\/S0304-3975(02)00853-8_BIB4","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1145\/357103.357112","article-title":"An improved context-free recognizer","volume":"2","author":"Graham","year":"1980","journal-title":"ACM Trans. Program. Languages Systems"},{"key":"10.1016\/S0304-3975(02)00853-8_BIB5","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/S0304-3975(02)00853-8_BIB6","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/S0022-0000(75)80050-X","article-title":"Space-bounded reducibility among combinatorial problems","volume":"11","author":"Jones","year":"1975","journal-title":"J. Comput System Sci."},{"issue":"4","key":"10.1016\/S0304-3975(02)00853-8_BIB7","first-page":"519","article-title":"Conjunctive grammars","volume":"6","author":"Okhotin","year":"2001","journal-title":"J. Autom. Languages Combin"},{"key":"10.1016\/S0304-3975(02)00853-8_BIB8","unstructured":"A. Okhotin, On P-completeness of the membership problem for conjunctive grammars, an abstract of a conference talk (in Russian), Diskretnaya matematika i matematicheskaya kibernetika: trudy mezhdunarodnoi shkoly-seminara, Ratmino, 31 May\u20133 June 2001, (Proceedings of the International School-Seminar on Discrete Mathematics and Mathematical Cybernetics)."},{"issue":"1","key":"10.1016\/S0304-3975(02)00853-8_BIB9","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1023\/A:1014219530875","article-title":"Top-down parsing of conjunctive languages","volume":"5","author":"Okhotin","year":"2002","journal-title":"Grammars"},{"issue":"4","key":"10.1016\/S0304-3975(02)00853-8_BIB10","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/321906.321913","article-title":"A note on tape-bounded complexity classes and linear context-free languages","volume":"22","author":"Sudborough","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(02)00853-8_BIB11","series-title":"Introduction to Circuit Complexity: A Uniform Approach","author":"Vollmer","year":"1999"},{"key":"10.1016\/S0304-3975(02)00853-8_BIB12","unstructured":"Whale Calf, a parser generator for conjunctive grammars, available at http:\/\/www.cs.queensu.ca\/home\/okhotin\/whalecalf\/."},{"key":"10.1016\/S0304-3975(02)00853-8_BIB13","first-page":"41","article-title":"Regular Languages","volume":"Vol. 1","author":"Yu","year":"1997"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502008538?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502008538?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,2]],"date-time":"2019-04-02T00:51:13Z","timestamp":1554166273000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502008538"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0304397502008538"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00853-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}