{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:59:56Z","timestamp":1725533996986},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642027369"},{"type":"electronic","value":"9783642027376"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02737-6_29","type":"book-chapter","created":{"date-parts":[[2009,6,30]],"date-time":"2009-06-30T08:40:30Z","timestamp":1246351230000},"page":"360-371","source":"Crossref","is-referenced-by-count":1,"title":["On Equations over Sets of Numbers and Their Limitations"],"prefix":"10.1007","author":[{"given":"Tommi","family":"Lehtinen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Okhotin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"29_CR1","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(1), 40\u201375 (1998)","journal-title":"Information and Computation"},{"key":"29_CR2","unstructured":"Je\u017c, A., Okhotin, A.: Conjunctive grammars over a unary alphabet: undecidability and unbounded growth. Theory of Computing Systems (to appear)"},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-540-70583-3_6","volume-title":"Automata, Languages and Programming","author":"A. Je\u017c","year":"2008","unstructured":"Je\u017c, A., Okhotin, A.: On the computational completeness of equations over sets of natural numbers. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 63\u201374. Springer, Heidelberg (2008)"},{"key":"29_CR4","unstructured":"Je\u017c, A., Okhotin, A.: Equations over sets of natural numbers with addition only. In: STACS 2009, Freiburg, Germany, February 26-28, 2009, pp. 577\u2013588 (2009)"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Kunc, M.: The power of commuting with finite sets of words. Theory of Computing Systems\u00a040(4), 521\u2013551 (2007)","DOI":"10.1007\/s00224-006-1321-z"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-540-73208-2_3","volume-title":"Developments in Language Theory","author":"M. Kunc","year":"2007","unstructured":"Kunc, M.: What do we know about language equations. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol.\u00a04588, pp. 23\u201327. Springer, Heidelberg (2007)"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0304-3975(94)90227-5","volume":"132","author":"E.L. Leiss","year":"1994","unstructured":"Leiss, E.L.: Unrestricted complementation in language equations over a one-letter alphabet. Theoretical Computer Science\u00a0132, 71\u201393 (1994)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"29_CR8","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s00037-007-0229-6","volume":"16","author":"P. McKenzie","year":"2007","unstructured":"McKenzie, P., Wagner, K.: The complexity of membership problems for circuits over sets of natural numbers. Computational Complexity\u00a016(3), 211\u2013244 (2007)","journal-title":"Computational Complexity"},{"issue":"4","key":"29_CR9","first-page":"519","volume":"6","author":"A. Okhotin","year":"2001","unstructured":"Okhotin, A.: Conjunctive grammars. Journal of Automata, Languages and Combinatorics\u00a06(4), 519\u2013535 (2001)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"29_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"A. Okhotin","year":"2003","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.\u00a02719. Springer, Heidelberg (2003)"},{"issue":"3","key":"29_CR11","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":"29_CR12","doi-asserted-by":"crossref","unstructured":"Okhotin, A., Rondogiannis, P.: On the expressive power of univariate equations over sets of natural numbers. In: IFIP Intl. Conf. on Theoretical Computer Science, TCS 2008, Milan, Italy, September 8-10, 2008, vol.\u00a0273, pp. 215\u2013227. IFIP (2008)","DOI":"10.1007\/978-0-387-09680-3_15"},{"key":"29_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/11779148_38","volume-title":"Developments in Language Theory","author":"A. Okhotin","year":"2006","unstructured":"Okhotin, A., Yakimova, O.: On language equations with complementation. In: H. Ibarra, O., Dang, Z. (eds.) DLT 2006. LNCS, vol.\u00a04036, pp. 420\u2013432. Springer, Heidelberg (2006)"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time. In: STOC 1973, pp. 1\u20139 (1973)","DOI":"10.1145\/800125.804029"},{"key":"29_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511755149","volume-title":"Additive Combinatorics","author":"T. Tao","year":"2006","unstructured":"Tao, T., Vu, V.: Additive Combinatorics. Cambridge University Press, Cambridge (2006)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02737-6_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T00:25:15Z","timestamp":1558398315000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02737-6_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027369","9783642027376"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02737-6_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}