{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:58Z","timestamp":1759638958396},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540341666"},{"type":"electronic","value":"9783540341680"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11753728_30","type":"book-chapter","created":{"date-parts":[[2006,4,27]],"date-time":"2006-04-27T20:17:13Z","timestamp":1146169033000},"page":"292-303","source":"Crossref","is-referenced-by-count":3,"title":["Language Equations with Symmetric Difference"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Okhotin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0049320","volume-title":"Computer Science Logic","author":"A. Aiken","year":"1994","unstructured":"Aiken, A., Kozen, D., Vardi, M.Y., Wimmers, E.L.: The complexity of set constraints. In: Meinke, K., B\u00f6rger, E., Gurevich, Y. (eds.) CSL 1993. LNCS, vol.\u00a0832, pp. 1\u201317. Springer, Heidelberg (1994)"},{"key":"30_CR2","doi-asserted-by":"publisher","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., Boasson, L.: Context-free languages and pushdown automata. In: Rozenberg, Salomaa (eds.) Handbook of Formal Languages, vol.\u00a01, pp. 111\u2013174. Springer, Berlin (1997)"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-45653-8_15","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"F. Baader","year":"2001","unstructured":"Baader, F., K\u00fcsters, R.: Unification in a description logic with transitive closure of roles. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS, vol.\u00a02250, pp. 217\u2013232. Springer, Heidelberg (2001)"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/S0022-0000(74)80027-9","volume":"8","author":"B.S. Baker","year":"1974","unstructured":"Baker, B.S., Book, R.V.: Reversal-bounded multipushdown machines. Journal of Computer and System Sciences\u00a08, 315\u2013332 (1974)","journal-title":"Journal of Computer and System Sciences"},{"key":"30_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/978-3-540-24749-4_52","volume-title":"STACS 2004","author":"S. Bala","year":"2004","unstructured":"Bala, S.: Regular language matching and other decidable cases of the satisfiability problem for constraints between regular open terms. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 596\u2013607. Springer, Heidelberg (2004)"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1006\/inco.1997.2692","volume":"142","author":"W. Charatonik","year":"1998","unstructured":"Charatonik, W.: Set constraints in some equational theories. Information and Computation\u00a0142, 40\u201375 (1998)","journal-title":"Information and Computation"},{"key":"30_CR7","volume-title":"Regular Algebra and Finite Machines","author":"J.H. Conway","year":"1971","unstructured":"Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, Boca Raton (1971)"},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1145\/321127.321132","volume":"9","author":"S. Ginsburg","year":"1962","unstructured":"Ginsburg, S., Rice, H.G.: Two families of languages related to ALGOL. Journal of the ACM\u00a09, 350\u2013371 (1962)","journal-title":"Journal of the ACM"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Hartmanis, J.: Context-free languages and Turing machine computations. In: Proceedings of Symposia in Applied Mathematics, vol.\u00a019, pp. 42\u201351. AMS (1967)","DOI":"10.1090\/psapm\/019\/0235938"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/978-3-540-31856-9_47","volume-title":"STACS 2005","author":"M. Kunc","year":"2005","unstructured":"Kunc, M.: The power of commuting with finite sets of words. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 569\u2013580. Springer, Heidelberg (2005)"},{"issue":"1","key":"30_CR11","first-page":"109","volume":"7","author":"A.R. Meyer","year":"2002","unstructured":"Meyer, A.R., Rabinovich, A.M.: Valid identity problem for shuffle regular expressions. Journal of Automata, Languages and Combinatorics\u00a07(1), 109\u2013125 (2002)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"issue":"5","key":"30_CR12","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1023\/A:1020213411126","volume":"28","author":"A. Okhotin","year":"2002","unstructured":"Okhotin, A.: Conjunctive grammars and systems of language equations. Programming and Computer Software\u00a028(5), 243\u2013249 (2002)","journal-title":"Programming and Computer Software"},{"key":"#cr-split#-30_CR13.1","doi-asserted-by":"crossref","unstructured":"Okhotin, A.: Decision problems for language equations with Boolean operations. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.??2719, pp. 239???251. Springer, Heidelberg (2003);","DOI":"10.1007\/3-540-45061-0_21"},{"key":"#cr-split#-30_CR13.2","unstructured":"Full journal version submitted"},{"key":"30_CR14","unstructured":"Okhotin, A.: Sistemy yazykovykh uravnenii i zamknutye klassy funktsii algebry logiki (Systems of language equations and closed classes of logic algebra functions) in Russian. In: Proceedings of the Fifth International conference Discrete models in the theory of control systems, pp. 56\u201364 (2003)"},{"issue":"1","key":"30_CR15","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.ic.2004.03.006","volume":"194","author":"A. Okhotin","year":"2004","unstructured":"Okhotin, A.: Boolean grammars. Information and Computation\u00a0194(1), 19\u201348 (2004)","journal-title":"Information and Computation"},{"issue":"2\u20133","key":"30_CR16","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/j.tcs.2005.07.019","volume":"345","author":"A. Okhotin","year":"2005","unstructured":"Okhotin, A.: The dual of concatenation. Theoretical Computer Science\u00a0345(2\u20133), 425\u2013447 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"30_CR17","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.tcs.2005.07.038","volume":"349","author":"A. Okhotin","year":"2005","unstructured":"Okhotin, A.: Unresolved systems of language equations: expressive power and decision problems. Theoretical Computer Science\u00a0349(3), 283\u2013308 (2005)","journal-title":"Theoretical Computer Science"},{"key":"30_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1007\/11549345_61","volume-title":"Mathematical Foundations of Computer Science 2005","author":"A. Okhotin","year":"2005","unstructured":"Okhotin, A.: Strict language inequalities and their decision problems. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 708\u2013719. Springer, Heidelberg (2005)"},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Okhotin, A., Yakimova, O.: On language equations with complementation, TUCS Technical Report No 735, Turku, Finland (December 2005)","DOI":"10.1007\/11779148_38"},{"key":"30_CR20","doi-asserted-by":"crossref","unstructured":"Post, E.L.: The two-valued iterative systems of mathematical logic (1941)","DOI":"10.1515\/9781400882366"},{"key":"30_CR21","unstructured":"Yablonski, S.V., Gavrilov, G.P., Kudryavtsev, V.B.: Funktsii algebry logiki i klassy Posta. Functions of logic algebra and the classes of Post (1966) (in Russian)"},{"issue":"1","key":"30_CR22","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.tcs.2003.10.013","volume":"313","author":"L. Zijl van","year":"2004","unstructured":"van Zijl, L.: On binary \u2295-NFAs and succinct descriptions of regular languages. Theoretical Computer Science\u00a0313(1), 159\u2013172 (2004)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11753728_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,26]],"date-time":"2021-07-26T05:13:19Z","timestamp":1627276399000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11753728_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540341666","9783540341680"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11753728_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}