{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:00:06Z","timestamp":1725890406951},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316227"},{"type":"electronic","value":"9783642316234"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31623-4_14","type":"book-chapter","created":{"date-parts":[[2012,7,9]],"date-time":"2012-07-09T01:03:34Z","timestamp":1341795814000},"page":"183-195","source":"Crossref","is-referenced-by-count":3,"title":["On the Number of Nonterminal Symbols in Unambiguous Conjunctive Grammars"],"prefix":"10.1007","author":[{"given":"Artur","family":"Je\u017c","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Okhotin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Allouche, J.-P., Shallit, J.: Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press (2003)","DOI":"10.1017\/CBO9780511546563"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Baader, F., Okhotin, A.: Complexity of language equations with one-sided concatenation and all Boolean operations. In: 20th International Workshop on Unification, UNIF 2006, Seattle, USA, August 11, pp. 59\u201373 (2006)","DOI":"10.25368\/2022.154"},{"key":"14_CR3","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, 195\u2013212; 16, 3\u201322 (1984)","journal-title":"International Journal of Computer Mathematics"},{"key":"14_CR4","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0019-9958(80)90164-3","volume":"44","author":"C. Dyer","year":"1980","unstructured":"Dyer, C.: One-way bounded cellular automata. Information and Control\u00a044, 261\u2013281 (1980)","journal-title":"Information and Control"},{"key":"14_CR5","unstructured":"Gruska, J.: Descriptional complexity of context-free languages. In: Mathematical Foundations of Computer Science, MFCS 1973, Strbsk\u00e9 Pleso, High Tatras, Czechoslovakia, September 3-8, pp. 71\u201383 (1973)"},{"issue":"3","key":"14_CR6","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":"14_CR7","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"},{"issue":"2","key":"14_CR8","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s00224-009-9246-y","volume":"48","author":"A. Je\u017c","year":"2011","unstructured":"Je\u017c, A., Okhotin, A.: Complexity of equations over sets of natural numbers. Theory of Computing Systems\u00a048(2), 319\u2013342 (2011)","journal-title":"Theory of Computing Systems"},{"issue":"2","key":"14_CR9","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s00224-011-9319-6","volume":"49","author":"A. Je\u017c","year":"2011","unstructured":"Je\u017c, A., Okhotin, A.: One-nonterminal conjunctive grammars over a unary alphabet. Theory of Computing Systems\u00a049(2), 319\u2013342 (2011)","journal-title":"Theory of Computing Systems"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Je\u017c, A., Okhotin, A.: Unambiguous conjunctive grammars over a one-letter alphabet. TUCS Technical Report 1043, Turku Centre for Computer Science (submitted for publication, April 2012)","DOI":"10.1007\/978-3-642-38771-5_25"},{"issue":"4","key":"14_CR11","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"},{"issue":"1","key":"14_CR12","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":"2-3","key":"14_CR13","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.tcs.2004.03.002","volume":"320","author":"A. Okhotin","year":"2004","unstructured":"Okhotin, A.: On the number of nonterminals in linear conjunctive grammars. Theoretical Computer Science\u00a0320(2-3), 419\u2013448 (2004)","journal-title":"Theoretical Computer Science"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"1234","DOI":"10.1016\/j.ic.2008.03.023","volume":"206","author":"A. Okhotin","year":"2008","unstructured":"Okhotin, A.: Unambiguous Boolean grammars. Information and Computation\u00a0206, 1234\u20131247 (2008)","journal-title":"Information and Computation"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-642-14455-4_31","volume-title":"Developments in Language Theory","author":"A. Okhotin","year":"2010","unstructured":"Okhotin, A.: Fast Parsing for Boolean Grammars: A Generalization of Valiant\u2019s Algorithm. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol.\u00a06224, pp. 340\u2013351. Springer, Heidelberg (2010)"},{"key":"14_CR16","unstructured":"Okhotin, A., Reitwie\u00dfner, C.: Parsing unary Boolean grammars using online convolution. In: Advances and Applications of Automata on Words and Trees (Dagstuhl seminar 10501), December 12-17 (2010)"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2012.01.004","volume":"212","author":"A. Okhotin","year":"2012","unstructured":"Okhotin, A., Rondogiannis, P.: On the expressive power of univariate equations over sets of natural numbers. Information and Computation\u00a0212, 1\u201314 (2012)","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31623-4_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,24]],"date-time":"2023-06-24T01:03:52Z","timestamp":1687568632000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31623-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316227","9783642316234"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31623-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}