{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T09:47:14Z","timestamp":1764841634664},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642144547"},{"type":"electronic","value":"9783642144554"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14455-4_27","type":"book-chapter","created":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T11:06:02Z","timestamp":1281697562000},"page":"291-302","source":"Crossref","is-referenced-by-count":7,"title":["On Language Equations XXK\u2009=\u2009XXL and XM\u2009=\u2009N over a Unary Alphabet"],"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":[{"key":"27_CR1","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)"},{"issue":"3","key":"27_CR2","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1142\/S012905410800584X","volume":"19","author":"A. Je\u017c","year":"2008","unstructured":"Je\u017c, A.: Conjunctive grammars can generate non-regular unary languages. International Journal of Foundations of Computer Science\u00a019(3), 597\u2013615 (2008)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"1","key":"27_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s00224-008-9139-5","volume":"46","author":"A. Je\u017c","year":"2010","unstructured":"Je\u017c, A., Okhotin, A.: Conjunctive grammars over a unary alphabet: undecidability and unbounded growth. Theory of Computing Systems\u00a046(1), 27\u201358 (2010)","journal-title":"Theory of Computing Systems"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"27_CR5","unstructured":"Je\u017c, A., Okhotin, A.: Equations over sets of natural numbers with addition only. In: STACS 2009, Freiburg, Germany, February 26-28, pp. 577\u2013588 (2009)"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/978-3-642-03351-3_19","volume-title":"Computer Science - Theory and Applications","author":"A. Je\u017c","year":"2009","unstructured":"Je\u017c, A., Okhotin, A.: One-nonterminal conjunctive grammars over a unary alphabet. In: Frid, A., Morozov, A., Rybalchenko, A., Wagner, K.W. (eds.) CSR 2009. LNCS, vol.\u00a05675, pp. 191\u2013202. Springer, Heidelberg (2009)"},{"key":"27_CR7","unstructured":"Je\u017c, A., Okhotin, A.: On equations over sets of integers. In: STACS 2010, Nancy, France, March 4-6, pp. 477\u2013488 (2010)"},{"key":"27_CR8","unstructured":"Karhum\u00e4ki, J., Kunc, M.: Personal Communication (September 2005)"},{"issue":"4","key":"27_CR9","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":"27_CR10","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":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1007\/978-3-642-02737-6_29","volume-title":"DLT 2009","author":"T. Lehtinen","year":"2009","unstructured":"Lehtinen, T., Okhotin, A.: On equations over sets of numbers and their limitations. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol.\u00a05583, pp. 360\u2013371. Springer, Heidelberg (2009)"},{"key":"27_CR12","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":"4","key":"27_CR13","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":"27_CR14","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)"},{"issue":"3-4","key":"27_CR15","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.jcss.2009.08.002","volume":"76","author":"A. Okhotin","year":"2010","unstructured":"Okhotin, A.: Decision problems for language equations. Journal of Computer and System Sciences\u00a076(3-4), 251\u2013266 (2010)","journal-title":"Journal of Computer and System Sciences"},{"key":"27_CR16","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers Jr.","year":"1967","unstructured":"Rogers Jr., H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967)"}],"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-14455-4_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:52:59Z","timestamp":1606168379000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14455-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642144547","9783642144554"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14455-4_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}