{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:14Z","timestamp":1759638914264},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540404934"},{"type":"electronic","value":"9783540450610"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45061-0_21","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T11:54:04Z","timestamp":1184586844000},"page":"239-251","source":"Crossref","is-referenced-by-count":15,"title":["Decision Problems for Language Equations with Boolean Operations"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Okhotin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/978-3-642-59136-5_3","volume":"1","author":"J. Autebert","year":"1997","unstructured":"J. Autebert, J. Berstel and L. Boasson, \u201cContext-Free Languages and Pushdown Automata\u201d, Handbook of Formal Languages, Vol. 1, 111\u2013174, Springer-Verlag, Berlin, 1997.","journal-title":"Handbook of Formal Languages"},{"key":"21_CR2","volume-title":"Descriptive complexity","author":"N. Immerman","year":"1998","unstructured":"N. Immerman, Descriptive complexity, Springer-Verlag, New York, 1998."},{"key":"21_CR3","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/978-3-642-59136-5_9","volume":"1","author":"W. Kuich","year":"1997","unstructured":"W. Kuich, \u201cSemirings and Formal Power Series: Their Relevance to Formal Language and Automata\u201d, Handbook of Formal Languages, Vol. 1, 609\u2013677, Springer-Verlag, Berlin, 1997.","journal-title":"Handbook of Formal Languages"},{"key":"21_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-2156-2","volume-title":"Language equations","author":"E._.L. Leiss","year":"1999","unstructured":"E._L. Leiss, Language equations, Springer-Verlag, New York, 1999."},{"issue":"4","key":"21_CR5","first-page":"519","volume":"6","author":"A. Okhotin","year":"2001","unstructured":"A. Okhotin, \u201cConjunctive grammars\u201d, Journal of Automata, Languages and Combinatorics, 6:4 (2001), 519\u2013535.","journal-title":"Journal of Automata, Languages and Combinatorics"},{"issue":"5","key":"21_CR6","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1023\/A:1020213411126","volume":"28","author":"A. Okhotin","year":"2002","unstructured":"A. Okhotin, \u201cConjunctive grammars and systems of language equations\u201d, Programming and Computer Software, 28:5 (2002) 243\u2013249.","journal-title":"Programming and Computer Software"},{"key":"21_CR7","unstructured":"Ch. H. Papadimitriou, Computational complexity, Addison-Wesley, 1994."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45061-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T19:00:51Z","timestamp":1550430051000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45061-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404934","9783540450610"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-45061-0_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}