{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:35:32Z","timestamp":1743053732826,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540958901"},{"type":"electronic","value":"9783540958918"}],"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-540-95891-8_39","type":"book-chapter","created":{"date-parts":[[2009,1,22]],"date-time":"2009-01-22T01:19:21Z","timestamp":1232587161000},"page":"425-436","source":"Crossref","is-referenced-by-count":0,"title":["Conjunctive Grammars with Restricted Disjunction"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Okhotin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Reitwie\u00dfner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","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":"39_CR2","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1145\/321250.321254","volume":"12","author":"S.A. Greibach","year":"1965","unstructured":"Greibach, S.A.: A new normal-form theorem for context-free phrase structure grammars. Journal of the ACM\u00a012, 42\u201352 (1965)","journal-title":"Journal of the ACM"},{"key":"39_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/B978-0-12-708240-0.50008-3","volume-title":"Theoretical Studies in Computer Science","author":"S.A. Greibach","year":"1992","unstructured":"Greibach, S.A., Shi, W., Simonson, S.: Single tree grammars. In: Ullman, J.D. (ed.) Theoretical Studies in Computer Science, pp. 73\u201399. Academic Press, London (1992)"},{"issue":"3","key":"39_CR4","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 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":"39_CR5","unstructured":"Je\u017c, A., Okhotin, A.: Conjunctive grammars over a unary alphabet: undecidability and unbounded growth. Theory of Computing Systems (to appear)"},{"key":"39_CR6","unstructured":"Je\u017c, A., Okhotin, A.: Complexity of solutions of equations over sets of natural numbers. In: 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2008), Bordeaux, France, February 21-23, 2008, pp. 373\u2013383 (2008)"},{"key":"39_CR7","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)"},{"issue":"4","key":"39_CR8","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":"39_CR9","doi-asserted-by":"crossref","unstructured":"Okhotin, A.: Unambiguous Boolean grammars. Information and Computation (to appear)","DOI":"10.1016\/j.ic.2008.03.023"},{"key":"39_CR10","unstructured":"Reitwie\u00dfner, C.: Formal Languages Defined by Recurrent Circuits, Diplomarbeit, University of W\u00fcrzburg (2007)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2009: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-95891-8_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T18:05:41Z","timestamp":1551722741000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-95891-8_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783540958901","9783540958918"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-95891-8_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}