{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:59:49Z","timestamp":1742921989507,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540699361"},{"type":"electronic","value":"9783540699378"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-69937-8_6","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"44-55","source":"Crossref","is-referenced-by-count":4,"title":["Conjunctive Grammars and Alternating Pushdown Automata"],"prefix":"10.1007","author":[{"given":"Tamar","family":"Aizikowitz","sequence":"first","affiliation":[]},{"given":"Michael","family":"Kaminski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"6_CR1","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":"6_CR2","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0304-3975(02)00853-8","volume":"302","author":"A. Okhotin","year":"2003","unstructured":"Okhotin, A.: A recognition and parsing algorithm for arbitrary conjunctive grammars. Theoretical Computer Science\u00a0302, 81\u2013124 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"6_CR3","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A.K. Chandra","year":"1981","unstructured":"Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. Journal of the ACM\u00a028(1), 114\u2013133 (1981)","journal-title":"Journal of the ACM"},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0213010","volume":"13","author":"R.E. Ladner","year":"1984","unstructured":"Ladner, R.E., Lipton, R.J., Stockmeyer, L.J.: Alternating pushdown and stack automata. SIAM Journal on Computing\u00a013(1), 135\u2013155 (1984)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR5","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)"},{"issue":"6","key":"6_CR6","doi-asserted-by":"publisher","first-page":"1103","DOI":"10.1142\/S0129054103002205","volume":"14","author":"A. Okhotin","year":"2003","unstructured":"Okhotin, A.: Efficient automaton-based recognition for linear conjunctive languages. International Journal of Foundations of Computer Science\u00a014(6), 1103\u20131116 (2003)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"1","key":"6_CR7","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 and trellis automata. RAIRO Theoretical Informatics and Applications\u00a038(1), 69\u201388 (2004)","journal-title":"RAIRO Theoretical Informatics and Applications"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Culik II, K., Gruska, J., Salomaa, A.: Systolic trellis automata, i and ii. International Journal of Computer Mathematics\u00a015 & 16(1 & 3\u20134), 3\u201322, 195\u2013212 (1984)","DOI":"10.1080\/00207168408803410"},{"issue":"6","key":"6_CR9","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/BF01191624","volume":"27","author":"K. Vijay-Shanker","year":"1994","unstructured":"Vijay-Shanker, K., Weir, D.J.: The equivalence of four extensions of context-free grammars. Mathematical Systems Theory\u00a027(6), 511\u2013546 (1994)","journal-title":"Mathematical Systems Theory"},{"issue":"1-3","key":"6_CR10","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1016\/S0304-3975(02)00543-1","volume":"299","author":"A. Okhotin","year":"2003","unstructured":"Okhotin, A.: On the closure properties of linear conjunctive languages. Theor. Comput. Sci.\u00a0299(1-3), 663\u2013685 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"6_CR11","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0304-3975(89)90023-6","volume":"67","author":"E. Moriya","year":"1989","unstructured":"Moriya, E.: A grammatical characterization of alternating pushdown automata. Theoretical Computer Science\u00a067(1), 75\u201385 (1989)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"6_CR12","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0304-3975(92)90355-J","volume":"99","author":"O.H. Ibarra","year":"1992","unstructured":"Ibarra, O.H., Jiang, T., Wang, H.: A characterization of exponential-time languages by alternating context-free grammars. Theoretical Computer Science\u00a099(2), 301\u2013313 (1992)","journal-title":"Theoretical Computer Science"},{"key":"6_CR13","volume-title":"Handbook of Logic and Language","author":"M. Moortgat","year":"1997","unstructured":"Moortgat, M.: Categorial type logics. In: van Benthem, J., ter Meulen, A. (eds.) Handbook of Logic and Language, Elsevier, Amsterdam (1997)"},{"issue":"3","key":"6_CR14","doi-asserted-by":"publisher","first-page":"154","DOI":"10.2307\/2310058","volume":"65","author":"J. Lambek","year":"1958","unstructured":"Lambek, J.: The mathematics of sentance structure. American Mathematical Monthly\u00a065(3), 154\u2013170 (1958)","journal-title":"American Mathematical Monthly"},{"issue":"F","key":"6_CR15","first-page":"1","volume":"9","author":"Y. Bar-Hillel","year":"1960","unstructured":"Bar-Hillel, Y., Gaifman, C., Shamir, E.: On categorial and phrase structure grammars. Bulletin of the Research Council of Israel\u00a09(F), 1\u201316 (1960)","journal-title":"Bulletin of the Research Council of Israel"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/S0019-9958(67)91172-2","volume":"10","author":"J.M. Cohen","year":"1967","unstructured":"Cohen, J.M.: The equivalence of two concepts of categorial grammar. Information and Control\u00a010, 475\u2013484 (1967)","journal-title":"Information and Control"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Pentus, M.: Lambek grammars are context free. In: Proc. of 8th Ann. IEEE Symp. on Logic in Computer Science, pp. 429\u2013433 (1993)","DOI":"10.1109\/LICS.1993.287565"},{"issue":"2","key":"6_CR18","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF00171695","volume":"1","author":"M. Kanazawa","year":"1992","unstructured":"Kanazawa, M.: The lambek calculus enriched with additional connectives. Journal of Logic, Language and Information\u00a01(2), 141\u2013171 (1992)","journal-title":"Journal of Logic, Language and Information"},{"issue":"3","key":"6_CR19","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1137\/0304034","volume":"4","author":"S. Ginsgurg","year":"1966","unstructured":"Ginsgurg, S., Spanier, E.H.: Finite-turn pushdown automata. SIAM Journal on Control\u00a04(3), 429\u2013453 (1966)","journal-title":"SIAM Journal on Control"},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"2152","DOI":"10.1016\/j.dam.2007.05.021","volume":"155","author":"M. Kutrib","year":"2007","unstructured":"Kutrib, M., Malcher, A.: Finite-turn pushdown automata. Discreet Applied Mathematics\u00a0155, 2152\u20132164 (2007)","journal-title":"Discreet Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69937-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T12:10:52Z","timestamp":1738325452000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-69937-8_6"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540699361","9783540699378"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69937-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}