{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:32:47Z","timestamp":1725895967037},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642201684"},{"type":"electronic","value":"9783642201691"}],"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-20169-1_1","type":"book-chapter","created":{"date-parts":[[2011,3,28]],"date-time":"2011-03-28T05:21:04Z","timestamp":1301289664000},"page":"1-16","source":"Crossref","is-referenced-by-count":1,"title":["Linear Conjunctive Grammars and One-Turn Synchronized Alternating Pushdown Automata"],"prefix":"10.1007","author":[{"given":"Tamar","family":"Aizikowitz","sequence":"first","affiliation":[]},{"given":"Michael","family":"Kaminski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-540-69937-8_6","volume-title":"Logic, Language, Information and Computation","author":"T. Aizikowitz","year":"2008","unstructured":"Aizikowitz, T., Kaminski, M.: Conjunctive grammars and alternating pushdown automata. In: Hodges, W., de Queiroz, R. (eds.) WoLLIC 2008. LNCS (LNAI), vol.\u00a05110, pp. 44\u201355. Springer, Heidelberg (2008)"},{"key":"1_CR2","unstructured":"Aizikowitz, T., Kaminski, M.: Linear conjunctive grammars and one-turn synchronized alternating pushdown automata. Technical Report CS-2009-15, Technion \u2013 Israel Institute of Technology (2009)"},{"issue":"1","key":"1_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"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Culik II, K., Gruska, J., Salomaa, A.: Systolic Trellis automata, I and II. International Journal of Computer Mathematics 15 and 16(1 and 3-4), 195\u2013212 and 3\u201322 (1984)","DOI":"10.1080\/00207168408803410"},{"issue":"3","key":"1_CR5","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1137\/0304034","volume":"4","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.H.: Finite-turn pushdown automata. SIAM Journal on Control\u00a04(3), 429\u2013453 (1966)","journal-title":"SIAM Journal on Control"},{"key":"1_CR6","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":"3","key":"1_CR7","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1145\/377978.377993","volume":"2","author":"O. Kupferman","year":"2001","unstructured":"Kupferman, O., Vardi, M.Y.: Weak alternating automata are not that weak. ACM Transaction on Computational Logic\u00a02(3), 408\u2013429 (2001)","journal-title":"ACM Transaction on Computational Logic"},{"issue":"16","key":"1_CR8","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 turns and the regular closure of linear context-free languages. Discrete Applied Mathematics\u00a0155(16), 2152\u20132164 (2007)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"1_CR9","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"},{"issue":"4","key":"1_CR10","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":"1_CR11","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":"6","key":"1_CR12","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":"1_CR13","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"},{"issue":"1-3","key":"1_CR14","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. Theoretical Computer Science\u00a0299(1-3), 663\u2013685 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"1_CR15","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"}],"container-title":["Lecture Notes in Computer Science","Formal Grammar"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20169-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T08:22:03Z","timestamp":1558513323000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20169-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642201684","9783642201691"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20169-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}