{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:54:38Z","timestamp":1775012078792,"version":"3.50.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Programming and Computer Software"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1023\/a:1020213411126","type":"journal-article","created":{"date-parts":[[2003,3,15]],"date-time":"2003-03-15T08:37:24Z","timestamp":1047717444000},"page":"243-249","source":"Crossref","is-referenced-by-count":35,"title":["Conjunctive Grammars and Systems of Language Equations"],"prefix":"10.1007","volume":"28","author":[{"given":"A. S.","family":"Okhotin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"454428_CR1","unstructured":"Okhotin, A.S., On Augmenting the Formalism of Context-free Grammars with an Intersection Operation, Proc. of the IV Int. Conf. \u201cDiscrete Models in the Control System Theory,\u201d 2000, pp. 106-109."},{"key":"#cr-split#-454428_CR2.1","unstructured":"Okhotin, A., Conjunctive Grammars, Pre-proceedings of DCAGRS 2000"},{"key":"#cr-split#-454428_CR2.2","unstructured":"Techn. report of Dept. of Computer Science, University of Western Ontario, London, Ontario, Canada, 2000, no. 555."},{"issue":"4","key":"454428_CR3","first-page":"519","volume":"6","author":"A. Okhotin","year":"2001","unstructured":"Okhotin, A., Conjunctive Grammars, J. Automata, Languages and Combinatorics, 2001, vol. 6, no. 4, pp. 519-535.","journal-title":"J. Automata, Languages and Combinatorics"},{"issue":"1","key":"454428_CR4","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1023\/A:1014219530875","volume":"5","author":"A. Okhotin","year":"2002","unstructured":"Okhotin, A., Top-Down Parsing of Conjunctive Languages, Grammars, 2002, vol. 5, no. 1, pp. 21-40.","journal-title":"Grammars"},{"key":"454428_CR5","unstructured":"Okhotin, A., A Recognition and Parsing Algorithm for Arbitrary Conjunctive Grammars, Theor. Comput. Sci. C, in press."},{"issue":"2","key":"454428_CR6","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1023\/A:1016329527130","volume":"5","author":"A. Okhotin","year":"2002","unstructured":"Okhotin, A., LR Parsing for Conjunctive Grammars, Grammars, 2002, vol. 5, no. 2, pp. 81-125.","journal-title":"Grammars"},{"key":"454428_CR7","unstructured":"Okhotin, A.S., On P-Completeness of the Membership Problem for Conjunctive Grammars, Proc. of the Int. Workshop on Discrete Mathematics and Mathematical Cybernetics, Ratmino, 2001."},{"issue":"4","key":"454428_CR8","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/321906.321913","volume":"22","author":"I.H. Sudborough","year":"1975","unstructured":"Sudborough, I.H., A Note on Tape-bounded Complexity Classes and Linear Context-free Languages, J. ACM, 1975, vol. 22, no. 4, pp. 499-500.","journal-title":"J. ACM"},{"key":"454428_CR9","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/978-3-642-59136-5_3","volume-title":"Handbook of Formal Languages","author":"J. Autebert","year":"1997","unstructured":"Autebert, J., Berstel, J., and Boasson, L., Context-Free Languages and Pushdown Automata, in Handbook of Formal Languages, Berlin: Springer, 1997, vol. 1, pp. 111-174."},{"key":"454428_CR10","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/978-3-642-59136-5_9","volume-title":"Handbook of Formal Languages","author":"W. Kuich","year":"1997","unstructured":"Kuich, W., Semirings and Formal Power Series: Their Relevance to Formal Language and Automata, in Handbook of Formal Languages, Berlin: Springer, 1997, vol. 1, pp. 609-677."}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020213411126.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1020213411126","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020213411126.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T01:52:03Z","timestamp":1775008323000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1020213411126"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["454428"],"URL":"https:\/\/doi.org\/10.1023\/a:1020213411126","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}