{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:01Z","timestamp":1759637941126},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642183805"},{"type":"electronic","value":"9783642183812"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-18381-2_36","type":"book-chapter","created":{"date-parts":[[2011,1,4]],"date-time":"2011-01-04T16:01:51Z","timestamp":1294156911000},"page":"431-443","source":"Crossref","is-referenced-by-count":7,"title":["Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Okhotin","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: ACM Symposium on Theory of Computing, STOC 2004, Chicago, USA, June 13\u201316, pp. 202\u2013211 (2004)","DOI":"10.1145\/1007352.1007390"},{"key":"36_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/3-540-45711-9_1","volume-title":"Formal and Natural Computing","author":"J. Berstel","year":"2002","unstructured":"Berstel, J., Boasson, L.: Balanced grammars and their languages. In: Brauer, W., Ehrig, H., Karhum\u00e4ki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol.\u00a02300, pp. 3\u201325. Springer, Heidelberg (2002)"},{"key":"36_CR3","unstructured":"Crespi-Reghizzi, S., Mandrioli, D.: Algebraic properties of structured context-free languages: old approaches and novel developments. In: WORDS (2009)"},{"issue":"1984","key":"36_CR4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1080\/00207168408803421","volume":"16","author":"K. \u010cul\u00edk II","year":"1984","unstructured":"\u010cul\u00edk II, K., Gruska, J., Salomaa, A.: Systolic trellis automata. International Journal of Computer Mathematics\u00a015, 195\u2013212 (1984); 16, 3\u201322 (1984)","journal-title":"International Journal of Computer Mathematics\u00a015, 195\u2013212"},{"key":"36_CR5","doi-asserted-by":"publisher","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":"36_CR6","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0304-3975(84)90015-X","volume":"29","author":"O.H. Ibarra","year":"1984","unstructured":"Ibarra, O.H., Kim, S.M.: Characterizations and computational complexity of systolic trellis automata. Theoretical Computer Science\u00a029, 123\u2013153 (1984)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"36_CR7","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":"36_CR8","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":"36_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-642-02737-6_27","volume-title":"Developments in Language Theory","author":"V. Kountouriotis","year":"2009","unstructured":"Kountouriotis, V., Nomikos, C., Rondogiannis, P.: A game-theoretic characterization of Boolean grammars. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol.\u00a05583, pp. 334\u2013347. Springer, Heidelberg (2009)"},{"issue":"3","key":"36_CR10","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/321406.321411","volume":"14","author":"R. McNaughton","year":"1967","unstructured":"McNaughton, R.: Parenthesis grammars. Journal of the ACM\u00a014(3), 490\u2013500 (1967)","journal-title":"Journal of the ACM"},{"issue":"4","key":"36_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":"36_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":"1","key":"36_CR13","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.ic.2004.03.006","volume":"194","author":"A. Okhotin","year":"2004","unstructured":"Okhotin, A.: Boolean grammars. Information and Computation\u00a0194(1), 19\u201348 (2004)","journal-title":"Information and Computation"},{"key":"36_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":"36_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)"},{"issue":"26-28","key":"36_CR16","doi-asserted-by":"publisher","first-page":"2559","DOI":"10.1016\/j.tcs.2010.03.015","volume":"411","author":"A. Okhotin","year":"2010","unstructured":"Okhotin, A., Reitwie\u00dfner, C.: Conjunctive grammars with restricted disjunction. Theoretical Computer Science\u00a0411(26-28), 2559\u20132571 (2010)","journal-title":"Theoretical Computer Science"},{"key":"36_CR17","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0304-3975(94)00212-2","volume":"141","author":"V. Terrier","year":"1995","unstructured":"Terrier, V.: On real-time one-way cellular array. Theoretical Computer Science\u00a0141, 331\u2013335 (1995)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2011: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18381-2_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T11:02:58Z","timestamp":1553338978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18381-2_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642183805","9783642183812"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18381-2_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}