{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:53:40Z","timestamp":1725515620170},"publisher-location":"Boston, MA","reference-count":8,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387096797"},{"type":"electronic","value":"9780387096803"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-0-387-09680-3_15","type":"book-chapter","created":{"date-parts":[[2008,7,21]],"date-time":"2008-07-21T11:37:14Z","timestamp":1216640234000},"page":"215-227","source":"Crossref","is-referenced-by-count":4,"title":["On the expressive power of univariate equations over sets of natural numbers"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Okhotin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos","family":"Rondogiannis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"A. Alhazov, personal communication, September 2007."},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"F. Baader, A. Okhotin, \u201cComplexity of language equations with one-sided concatenation and all Boolean operations\u201d, 20th International Workshop on Unification (UNIF 2006, Seattle, USA, August 11, 2006), 59\u201373.","DOI":"10.25368\/2022.154"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"A. Je\u017c, \u201cConjunctive grammars can generate non-regular unary languages\u201d, Developments in Language Theory (DLT 2007, Turku, Finland, July 3\u20136, 2007), LNCS 4588, 242\u2013253.","DOI":"10.1007\/978-3-540-73208-2_24"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"A. Je\u017c, A. Okhotin, \u201cConjunctive grammars over a unary alphabet: undecidability and unbounded growth\u201d, Computer Science in Russia (CSR 2007, Ekaterinburg, Russia, September 3\u20137, 2007), LNCS 4649, 168\u2013181.","DOI":"10.1007\/978-3-540-74510-5_19"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"M. Kunc, \u201cWhat do we know about language equations?\u201d, Developments in Language Theory (DLT 2007, Turku, Finland, July 3\u20136, 2007), LNCS 4588, 23\u201327.","DOI":"10.1007\/978-3-540-73208-2_3"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0304-3975(94)90227-5","volume":"132","author":"E.L. Leiss","year":"1994","unstructured":"E. L. Leiss, \u201cUnrestricted complementation in language equations over a one-letter alphabet\u201d, Theoretical Computer Science, 132 (1994), 71\u201393.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"15_CR7","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"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"A. Okhotin, O. Yakimova, \u201cOn language equations with complementation\u201d, Developments in Language Theory (DLT 2006, Santa Barbara, USA, June 26\u201329, 2006), LNCS 4036, 420\u2013432.","DOI":"10.1007\/11779148_38"}],"container-title":["IFIP International Federation for Information Processing","Fifth Ifip International Conference On Theoretical Computer Science \u2013 Tcs 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-09680-3_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,19]],"date-time":"2023-05-19T07:43:50Z","timestamp":1684482230000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-09680-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387096797","9780387096803"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-09680-3_15","relation":{},"ISSN":["1571-5736"],"issn-type":[{"type":"print","value":"1571-5736"}],"subject":[]}}