Skip to main content
Springer Nature Link
Log in

Logics for context-free languages

  • Conference paper
  • First Online:
Computer Science Logic (CSL 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 933))

Included in the following conference series:

Abstract

We define matchings, and show that they capture the essence of context-freeness. More precisely, we show that the class of context-free languages coincides with the class of those sets of strings which can be defined by sentences of the form ∃ bϕ, where ϕ is first order, b is a binary predicate symbol, and the range of the second order quantifier is restricted to the class of matchings. Several variations and extensions are discussed.

Work done while on sabbatical leave at the Universidad Politecnica di Catalunya

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Ajtai and R. Fagin. Reachability is harder for directed than for undirected finite graphs. Journal of Symbolic Logic, 55(1):113–150, 1990.

    Google Scholar 

  2. D. A. M. Barrington, K. Compton, H. Straubing, and D. Thérien. Regular languages in NC1. Journal of Computer and System Sciences, 44:478–499, 1992.

    Article  Google Scholar 

  3. J. R. Büchi. Weak second order arithmetic and finite automata. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 6:66–92, 1960.

    Google Scholar 

  4. M. de Rougemont. Second-order and inductive definability on finite structures. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 33:47–63, 1987.

    Google Scholar 

  5. J. Doner. Tree acceptors and some of their applications. Journal of Computer and System Sciences, 4:406–451, 1970.

    Google Scholar 

  6. R. Fagin. Monadic generalized spectra. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 21:89–96, 1975.

    Google Scholar 

  7. R. Fagin, L. J. Stockmeyer, and M. Y. Vardi. On monadic NP vs. monadic Co-NP. In Proc. 8 th Annual Conference Structure in Complexity Theory, pages 19–30, 1993. To appear in Information and Computation.

    Google Scholar 

  8. F. Gécseg and M. Steinby. Tree Automata. Akadémiai Kiadó, 1984.

    Google Scholar 

  9. J. Mezei and J. B. Wright. Algebraic automata and context-free sets. Information and Control, 11:3–29, 1967.

    Google Scholar 

  10. A. Salomaa. Formal Languages. Academic Press, 1987.

    Google Scholar 

  11. T. Schwentick. Graph connectivity and monadic NP. In Proc. 35st IEEE Symp. on Foundations of Computer Science, pages 614–622, 1994.

    Google Scholar 

  12. T. Schwentick. Graph connectivity, monadic NP and built-in relations of moderate degree. In Proc. 22nd International Colloq. on Automata, Languages, and Programming, 1995. to appear.

    Google Scholar 

  13. J. W. Thatcher and J. B. Wright. Generalized finite automata theory with an application to a decision problem of second-order-logic. Mathematical System Theory, 2:57–81, 1968.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Johannes Gutenberg-Universität Mainz, Deutschland

    Clemens Lautemann & Thomas Schwentick

  2. McGill University Montreal, Canada

    Denis Thérien

Authors
  1. Clemens Lautemann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Schwentick
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Denis Thérien
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Leszek Pacholski Jerzy Tiuryn

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lautemann, C., Schwentick, T., Thérien, D. (1995). Logics for context-free languages. In: Pacholski, L., Tiuryn, J. (eds) Computer Science Logic. CSL 1994. Lecture Notes in Computer Science, vol 933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022257

Download citation

  • DOI: https://doi.org/10.1007/BFb0022257

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60017-6

  • Online ISBN: 978-3-540-49404-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics