Skip to main content
SpringerLink
Log in

LR(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata

  • Conference paper
Book cover Computer Science – Theory and Applications (CSR 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6651))

Included in the following conference series:

Abstract

In this paper we introduce a sub-family of synchronized alternating pushdown automata, Deterministic Synchronized Alternating Pushdown Automata, and a sub-family of conjunctive grammars, LR(0) Conjunctive Grammars. We prove that deterministic SAPDA and LR(0) conjunctive grammars have the same recognition/generation power, analogously to the classical equivalence between acceptance by empty stack of deterministic PDA and LR(0) grammars. These models form the theoretical basis for efficient, linear, parsing of a rich sub-family of conjunctive languages, which properly includes all the boolean combinations of context-free LR(0) languages.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aizikowitz, T., Kaminski, M.: Conjunctive grammars and alternating pushdown automata. In: Hodges, W., de Queiroz, R. (eds.) Logic, Language, Information and Computation. LNCS (LNAI), vol. 5110, pp. 30–41. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  2. Aizikowitz, T.: Synchronized Alternating Pushdown Automata. PhD thesis, Technion – Israel Institute of Technology (2010), http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/2010/PHD/PHD-2010-14

  3. Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. Journal of the ACM 28(1), 114–133 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  4. Higginbotham, J.: English is not a context-free language. Linguistic Inquiry 15, 119–126 (1984)

    Google Scholar 

  5. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  6. Knuth, D.E.: On the translation of languages from left to right. Information and Control 8, 607–639 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  7. Ladner, R.E., Lipton, R.J., Stockmeyer, L.J.: Alternating pushdown and stack automata. SIAM Journal on Computing 13(1), 135–155 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  8. Langendoen, T.D., Postal, P.M.: English and the class of context-free languages. Computational Linguistics 10(3-4), 177–181 (1984)

    Google Scholar 

  9. Okhotin, A.: Conjunctive grammars. Journal of Automata, Languages and Combinatorics 6(4), 519–535 (2001)

    MathSciNet  MATH  Google Scholar 

  10. Okhotin, A.: Top-down parsing of conjunctive languages. Grammars 5(1), 21–40 (2002)

    Article  MATH  Google Scholar 

  11. Okhotin, A.: LR parsing for conjunctive grammars. Grammars 5(2), 21–40 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  12. Okhotin, A.: A recognition and parsing algorithm for arbitrary conjunctive grammars. Theoretical Computer Science 302, 81–124 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  13. Okhotin, A.: Fast parsing for boolean grammars: A generalization of valiant”s algorithm. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol. 6224, pp. 340–351. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  14. Tomita, M.: Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems. Kluwer Academic Publishers, Norwell (1985)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Technion – Israel Institute of Technology, Haifa, 32000, Israel

    Tamar Aizikowitz & Michael Kaminski

Authors
  1. Tamar Aizikowitz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Kaminski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Steklov Institute of Mathematics at St. Petersburg, 27 Fontanka, 191023, St.Petersburg, Russia

    Alexander Kulikov

  2. Department of Mathematical Logic and Theory of Algorithms, Moscow State University, Leninskie gory, 119991, Moscow, Russia

    Nikolay Vereshchagin

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aizikowitz, T., Kaminski, M. (2011). LR(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata. In: Kulikov, A., Vereshchagin, N. (eds) Computer Science – Theory and Applications. CSR 2011. Lecture Notes in Computer Science, vol 6651. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20712-9_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20712-9_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20711-2

  • Online ISBN: 978-3-642-20712-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation