{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T12:41:53Z","timestamp":1648903313169},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,3,26]],"date-time":"2013-03-26T00:00:00Z","timestamp":1364256000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s00236-013-0177-3","type":"journal-article","created":{"date-parts":[[2013,3,25]],"date-time":"2013-03-25T11:34:40Z","timestamp":1364211280000},"page":"175-197","source":"Crossref","is-referenced-by-count":3,"title":["Conjunctive grammars and alternating pushdown automata"],"prefix":"10.1007","volume":"50","author":[{"given":"Tamar","family":"Aizikowitz","sequence":"first","affiliation":[]},{"given":"Michael","family":"Kaminski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,3,26]]},"reference":[{"key":"177_CR1","volume-title":"The Theory of Parsing, Translation, and Compiling, Volume I Parsing","author":"AV Aho","year":"1972","unstructured":"Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation, and Compiling, Volume I Parsing. Prentice-Hall, Englewood Cliffs (1972)"},{"key":"177_CR2","unstructured":"Aizikowitz, T., Kaminski, M.: Conjunctive grammars and alternating pushdown automata. In: Hodges, W., de Queiroz, R. (Eds.) The 15th Workshop on Logic, Language, Information and Computation\u2014WoLLIC\u20192008, Volume 5110 of Lecture Notes in Artificial Intelligence, pp. 30\u201341. Springer, Berlin\/Heidelberg (2008)"},{"key":"177_CR3","doi-asserted-by":"crossref","unstructured":"Aizikowitz, T., Kaminski, M.: Linear conjunctive grammars and one-turn synchronized alternating pushdown automata. In: de Groote, P., Egg, M., Kallmeyer, L. (Eds.) Formal Grammar, 14th International Conference\u2014FG 2009, Volume 5591 of Lecture Notes in Artificial Intelligence, pp. 1\u201316. Springer, Berlin\/Heidelberg (2011)","DOI":"10.1007\/978-3-642-20169-1_1"},{"key":"177_CR4","doi-asserted-by":"crossref","unstructured":"Aizikowitz, T., Kaminski, M.: $$LR(0)$$ conjunctive grammars and deterministic synchronized alternating pushdown automata. In: Kulikov, A.S., Vereshchagin, N.K. (Eds.) The 6th International Computer Science Symposium in Russia\u2014CSR 2011, Volume 6651 of Lecture Notes in Computer Science, pp. 345\u2013358. Springer, Berlin\/Heidelberg (2011)","DOI":"10.1007\/978-3-642-20712-9_27"},{"key":"177_CR5","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, STOC \u201904, pp. 202\u2013211. ACM (2004)","DOI":"10.1145\/1007352.1007390"},{"issue":"1","key":"177_CR6","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"AK Chandra","year":"1981","unstructured":"Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. J. ACM 28(1), 114\u2013133 (1981)","journal-title":"J. ACM"},{"key":"177_CR7","doi-asserted-by":"crossref","unstructured":"Culik, K., II, Gruska, J., Salomaa, A.: Systolic trellis automata, I and II. Int. J. Comput. Math. 15 and 16, 195\u2013212 and 3\u201322 (1984)","DOI":"10.1080\/00207168408803421"},{"issue":"3","key":"177_CR8","doi-asserted-by":"crossref","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 J. Control 4(3), 429\u2013453 (1966)","journal-title":"SIAM J. Control"},{"key":"177_CR9","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)"},{"key":"177_CR10","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1142\/S012905410800584X","volume":"19","author":"A Jez","year":"2008","unstructured":"Jez, A.: Conjunctive grammars generate non-regular unary languages. Int. J. Found. Comput. Sci. 19, 597\u2013615 (2008)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"177_CR11","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s00224-008-9139-5","volume":"46","author":"A Jez","year":"2010","unstructured":"Jez, A., Okhotin, A.: Conjunctive grammars over a unary alphabet: undecidability and unbounded growth. Theory Comput. Syst. 46, 27\u201358 (2010)","journal-title":"Theory Comput. Syst."},{"key":"177_CR12","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1016\/S0019-9958(65)90426-2","volume":"8","author":"DE Knuth","year":"1965","unstructured":"Knuth, D.E.: On the translation of languages from left to right. Inf. Control 8, 607\u2013639 (1965)","journal-title":"Inf. Control"},{"key":"177_CR13","unstructured":"Kupferman, O., Vardi, M.Y.: Weak alternating automata are not that weak. ACM Trans. Comput. Logic 2, 408\u2013429 (2001)"},{"key":"177_CR14","doi-asserted-by":"crossref","unstructured":"Kupferman, O., Zuhovitzky, Sh: An improved algorithm for the membership problem for extended regular expressions. In: Diks, K., Rytter, W. (Eds.) Mathematical Foundations of Computer Science, Volume 2420 of Lecture Notes in Computer Science, pp. 446\u2013458. Springer, Berlin\/Heidelberg (2002)","DOI":"10.1007\/3-540-45687-2_37"},{"issue":"1","key":"177_CR15","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0213010","volume":"13","author":"RE Ladner","year":"1984","unstructured":"Ladner, R.E., Lipton, R.J., Stockmeyer, L.J.: Alternating pushdown and stack automata. SIAM J. Comput. 13(1), 135\u2013155 (1984)","journal-title":"SIAM J. Comput."},{"key":"177_CR16","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1142\/S0129054110007568","volume":"21","author":"T Lehtinen","year":"2010","unstructured":"Lehtinen, T., Okhotin, A.: Boolean grammars and GSM mappings. Int. J. Found. Comput. Sci. 21, 799\u2013815 (2010)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"177_CR17","volume-title":"Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems","author":"T Masaru","year":"1985","unstructured":"Masaru, T.: Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems. Kluwer, Norwell (1985)"},{"issue":"4","key":"177_CR18","first-page":"519","volume":"6","author":"A Okhotin","year":"2001","unstructured":"Okhotin, A.: Conjunctive grammars. J. Autom. Lang. Comb. 6(4), 519\u2013535 (2001)","journal-title":"J. Autom. Lang. Comb."},{"issue":"2","key":"177_CR19","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1023\/A:1014219530875","volume":"5","author":"A Okhotin","year":"2002","unstructured":"Okhotin, A.: LR parsing for conjunctive grammars. Grammars 5(2), 21\u201340 (2002)","journal-title":"Grammars"},{"key":"177_CR20","unstructured":"Okhotin, A.: Conjunctive Langauges are Closed Under Inverse Homomorphism. Technical Report 2003\/468, School of Computing, Queens University (2003)"},{"issue":"6","key":"177_CR21","doi-asserted-by":"crossref","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. Int. J. Found. Comput. Sci. 14(6), 1103\u20131116 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"177_CR22","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 302, 81\u2013124 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"177_CR23","doi-asserted-by":"crossref","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 Theor. Inform. Appl. 38(1), 69\u201388 (2004)","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"177_CR24","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 411, 2559\u20132571 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"177_CR25","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1016\/0022-0000(78)90030-2","volume":"16","author":"D Wotschke","year":"1978","unstructured":"Wotschke, D.: Nondeterminism and boolean operations in PDA\u2019s. J. Comput. Syst. Sci. 16(3), 456\u2013461 (1978)","journal-title":"J. Comput. Syst. Sci."},{"key":"177_CR26","doi-asserted-by":"crossref","unstructured":"Yamamoto, H.: An automata-based recognition algorithm for semi-extended regular expressions. In: Nielsen, M., Rovan, B. (Eds.) Mathematical Foundations of Computer Science\u2014MFCS 2000, 25th International Symposium, Volume 1893 of Lecture Notes in Computer Science, pp. 699\u2013708. Springer, Berlin\/Heidelberg (2000)","DOI":"10.1007\/3-540-44612-5_65"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-013-0177-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-013-0177-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-013-0177-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,11]],"date-time":"2019-07-11T09:33:21Z","timestamp":1562837601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-013-0177-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,26]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["177"],"URL":"https:\/\/doi.org\/10.1007\/s00236-013-0177-3","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,26]]}}}