{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:36:05Z","timestamp":1725536165167},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033506"},{"type":"electronic","value":"9783642033513"}],"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-03351-3_19","type":"book-chapter","created":{"date-parts":[[2009,8,3]],"date-time":"2009-08-03T12:53:58Z","timestamp":1249304038000},"page":"191-202","source":"Crossref","is-referenced-by-count":1,"title":["One-Nonterminal Conjunctive Grammars over a Unary Alphabet"],"prefix":"10.1007","author":[{"given":"Artur","family":"Je\u017c","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Okhotin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0019-9958(83)80022-9","volume":"57","author":"D.T. Huynh","year":"1983","unstructured":"Huynh, D.T.: Commutative grammars: the complexity of uniform word problems. Information and Control\u00a057(1), 21\u201339 (1983)","journal-title":"Information and Control"},{"issue":"3","key":"19_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"},{"key":"19_CR3","unstructured":"Je\u017c, A., Okhotin, A.: Conjunctive grammars over a unary alphabet: undecidability and unbounded growth. Theory of Computing Systems (to appear)"},{"key":"19_CR4","unstructured":"Je\u017c, A., Okhotin, A.: Complexity of equations over sets of natural numbers. In: 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2008), Bordeaux, France, February 21-23, pp. 373\u2013383 (2008)"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Je\u017c, A., Okhotin, A.: On the computational completeness of equations over sets of natural numbers. In: 35th International Colloquium on Automata, Languages and Programming (ICALP 2008), Reykjavik, Iceland, July 7-11, pp. 63\u201374 (2008)","DOI":"10.1007\/978-3-540-70583-3_6"},{"key":"19_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)"},{"issue":"5","key":"19_CR7","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.1137\/S0097539704445950","volume":"35","author":"M. Lohrey","year":"2006","unstructured":"Lohrey, M.: Word problems and membership problems on compressed words. SIAM Journal on Computing\u00a035(5), 1210\u20131240 (2006)","journal-title":"SIAM Journal on Computing"},{"key":"19_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.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":"19_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":"19_CR10","first-page":"96","volume":"91","author":"A. Okhotin","year":"2007","unstructured":"Okhotin, A.: Nine open problems for conjunctive and Boolean grammars. Bulletin of the EATCS\u00a091, 96\u2013119 (2007)","journal-title":"Bulletin of the EATCS"},{"key":"19_CR11","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. IFIP, vol.\u00a0273, pp. 215\u2013227 (2008)","DOI":"10.1007\/978-0-387-09680-3_15"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-642-60207-8_23","volume-title":"Jewels are Forever","author":"W. Plandowski","year":"1999","unstructured":"Plandowski, W., Rytter, W.: Complexity of language recognition problems for compressed words. In: Karhum\u00e4ki, J., Maurer, H.A., P\u0103un, G., Rozenberg, G. (eds.) Jewels are Forever, pp. 262\u2013272. Springer, Heidelberg (1999)"},{"key":"19_CR13","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","Computer Science - Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03351-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T20:40:36Z","timestamp":1558471236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03351-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033506","9783642033513"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03351-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}