{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T23:02:50Z","timestamp":1648508570528},"reference-count":9,"publisher":"Elsevier BV","issue":"5","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\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0020-0190(02)00511-2","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T17:32:55Z","timestamp":1053365575000},"page":"247-253","source":"Crossref","is-referenced-by-count":6,"title":["The hardest linear conjunctive language"],"prefix":"10.1016","volume":"86","author":[{"given":"Alexander","family":"Okhotin","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(02)00511-2_BIB001","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/BF00264617","article-title":"On real-time cellular automata and trellis automata","volume":"21","author":"Choffrut","year":"1984","journal-title":"Acta Inform."},{"issue":"4","key":"10.1016\/S0020-0190(02)00511-2_BIB002","first-page":"519","article-title":"Conjunctive grammars","volume":"6","author":"Okhotin","year":"2001","journal-title":"J. Automat. Languages Combin."},{"key":"10.1016\/S0020-0190(02)00511-2_BIB003","doi-asserted-by":"crossref","unstructured":"A. Okhotin, A recognition and parsing algorithm for arbitrary conjunctive grammars, Theoret. Comput. Sci., to appear. doi: 10.1016\/S0304-3975(02)00853-8","DOI":"10.1016\/S0304-3975(02)00853-8"},{"key":"10.1016\/S0020-0190(02)00511-2_BIB004","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1016\/S0304-3975(02)00543-1","article-title":"On the closure properties of linear conjunctive languages","volume":"299","author":"Okhotin","year":"2003","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(02)00511-2_BIB005","doi-asserted-by":"crossref","unstructured":"A. Okhotin, Automaton representation of linear conjunctive languages, in: Developments in Language Theory, Proc. DLT 2002, Kyoto, Japan, Lecture Notes in Comput. Sci., Springer, Berlin, to appear","DOI":"10.1007\/3-540-45005-X_35"},{"key":"10.1016\/S0020-0190(02)00511-2_BIB006","unstructured":"A. Okhotin, A linear conjunctive grammar for the circuit value problem, Tech. Rept. 2002-460, School of Computing, Queen's University, Kingston, ON, 2002"},{"key":"10.1016\/S0020-0190(02)00511-2_BIB007","series-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"key":"10.1016\/S0020-0190(02)00511-2_BIB008","series-title":"5th Symposium on Fundamentals of Computation Theory","first-page":"315","article-title":"On the recognition of context-free languages","volume":"208","author":"Rytter","year":"1985"},{"key":"10.1016\/S0020-0190(02)00511-2_BIB009","series-title":"Introduction to Circuit Complexity: A Uniform Approach","author":"Vollmer","year":"1999"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002005112?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002005112?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T10:00:07Z","timestamp":1584525607000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002005112"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":9,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0020019002005112"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00511-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}