Abstract
In this paper we introduce a variant of alternating pushdown automata, Synchronized Alternating Pushdown Automata, which accept the same class of languages as those generated by conjunctive grammars.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Okhotin, A.: Conjunctive grammars. Journal of Automata, Languages and Combinatorics 6(4), 519–535 (2001)
Okhotin, A.: A recognition and parsing algorithm for arbitrary conjunctive grammars. Theoretical Computer Science 302, 81–124 (2003)
Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. Journal of the ACM 28(1), 114–133 (1981)
Ladner, R.E., Lipton, R.J., Stockmeyer, L.J.: Alternating pushdown and stack automata. SIAM Journal on Computing 13(1), 135–155 (1984)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)
Okhotin, A.: Efficient automaton-based recognition for linear conjunctive languages. International Journal of Foundations of Computer Science 14(6), 1103–1116 (2003)
Okhotin, A.: On the equivalence of linear conjunctive grammars and trellis automata. RAIRO Theoretical Informatics and Applications 38(1), 69–88 (2004)
Culik II, K., Gruska, J., Salomaa, A.: Systolic trellis automata, i and ii. International Journal of Computer Mathematics 15 & 16(1 & 3–4), 3–22, 195–212 (1984)
Vijay-Shanker, K., Weir, D.J.: The equivalence of four extensions of context-free grammars. Mathematical Systems Theory 27(6), 511–546 (1994)
Okhotin, A.: On the closure properties of linear conjunctive languages. Theor. Comput. Sci. 299(1-3), 663–685 (2003)
Moriya, E.: A grammatical characterization of alternating pushdown automata. Theoretical Computer Science 67(1), 75–85 (1989)
Ibarra, O.H., Jiang, T., Wang, H.: A characterization of exponential-time languages by alternating context-free grammars. Theoretical Computer Science 99(2), 301–313 (1992)
Moortgat, M.: Categorial type logics. In: van Benthem, J., ter Meulen, A. (eds.) Handbook of Logic and Language, Elsevier, Amsterdam (1997)
Lambek, J.: The mathematics of sentance structure. American Mathematical Monthly 65(3), 154–170 (1958)
Bar-Hillel, Y., Gaifman, C., Shamir, E.: On categorial and phrase structure grammars. Bulletin of the Research Council of Israel 9(F), 1–16 (1960)
Cohen, J.M.: The equivalence of two concepts of categorial grammar. Information and Control 10, 475–484 (1967)
Pentus, M.: Lambek grammars are context free. In: Proc. of 8th Ann. IEEE Symp. on Logic in Computer Science, pp. 429–433 (1993)
Kanazawa, M.: The lambek calculus enriched with additional connectives. Journal of Logic, Language and Information 1(2), 141–171 (1992)
Ginsgurg, S., Spanier, E.H.: Finite-turn pushdown automata. SIAM Journal on Control 4(3), 429–453 (1966)
Kutrib, M., Malcher, A.: Finite-turn pushdown automata. Discreet Applied Mathematics 155, 2152–2164 (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aizikowitz, T., Kaminski, M. (2008). Conjunctive Grammars and Alternating Pushdown Automata. In: Hodges, W., de Queiroz, R. (eds) Logic, Language, Information and Computation. WoLLIC 2008. Lecture Notes in Computer Science(), vol 5110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69937-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-69937-8_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69936-1
Online ISBN: 978-3-540-69937-8
eBook Packages: Computer ScienceComputer Science (R0)