{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:12:30Z","timestamp":1725516750319},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705826"},{"type":"electronic","value":"9783540705833"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70583-3_6","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"63-74","source":"Crossref","is-referenced-by-count":14,"title":["On the Computational Completeness of Equations over Sets of Natural Numbers"],"prefix":"10.1007","author":[{"given":"Artur","family":"Je\u017c","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":"6_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":"6_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1080\/00207168408803410","volume":"15","author":"K. Culik II","year":"1984","unstructured":"Culik II, K., Gruska, J., Salomaa, A.: Systolic trellis automata, I and II. International Journal of Computer Mathematics\u00a015, 16, 195\u2013212, 3\u201322 (1984)","journal-title":"International Journal of Computer Mathematics"},{"key":"6_CR3","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":"6_CR4","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":"6_CR5","series-title":"Lecture Notes in Computer Science","first-page":"1242","volume-title":"Developments in Language Theory","author":"A. Je\u017c","year":"2007","unstructured":"Je\u017c, A.: Conjunctive grammars can generate non-regular unary languages. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol.\u00a04588, pp. 1242\u20131253. Springer, Heidelberg (2007)"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/978-3-540-74510-5_19","volume-title":"Computer Science \u2013 Theory and Applications","author":"A. Je\u017c","year":"2007","unstructured":"Je\u017c, A., Okhotin, A.: Conjunctive grammars over a unary alphabet: undecidability and unbounded growth. In: Diekert, V., Volkov, M.V., Voronkov, A. (eds.) CSR 2007. LNCS, vol.\u00a04649, pp. 168\u2013181. Springer, Heidelberg (2007)"},{"key":"6_CR7","unstructured":"Je\u017c, A., Okhotin, A.: Complexity of equations over sets of numbers. In: STACS 2008 (2008)"},{"issue":"4","key":"6_CR8","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s00224-006-1321-z","volume":"40","author":"M. Kunc","year":"2007","unstructured":"Kunc, M.: The power of commuting with finite sets of words. Theory of Computing Systems\u00a040(4), 521\u2013551 (2007)","journal-title":"Theory of Computing Systems"},{"key":"6_CR9","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":"6_CR10","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"},{"key":"6_CR11","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.W.: The complexity of membership problems for circuits over sets of natural numbers. Computational Complexity\u00a016, 211\u2013244 (2007)","journal-title":"Computational Complexity"},{"issue":"4","key":"6_CR12","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":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-45061-0_21","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, pp. 239\u2013251. Springer, Heidelberg (2003)"},{"issue":"1","key":"6_CR14","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1051\/ita:2004004","volume":"38","author":"A. Okhotin","year":"2004","unstructured":"Okhotin, A.: On the equivalence of linear conjunctive grammars to trellis automata. Informatique Th\u00e9orique et Applications\u00a038(1), 69\u201388 (2004)","journal-title":"Informatique Th\u00e9orique et Applications"},{"issue":"3","key":"6_CR15","doi-asserted-by":"crossref","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":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. Springer, Heidelberg (2005)"},{"key":"6_CR17","unstructured":"Rogers Jr., H.: Theory of Recursive Functions and Effective Computability (1967)"},{"key":"6_CR18","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"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70583-3_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:08:06Z","timestamp":1605762486000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70583-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705826","9783540705833"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70583-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}