An automata approach to some problems on context-free grammars | SpringerLink
Skip to main content
Springer Nature Link
Log in

An automata approach to some problems on context-free grammars

  • Chapter
  • First Online:
Foundations of Computer Science

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

Abstract

In Chapter 4 of [2], Book and Otto solve a number of word problems for monadic string-rewriting systems using an elegant automata-based technique. In this note we observe that the technique is also very interesting from a pedagogical point of view, since it provides a uniform solution to several elementary problems on context-free languages. We hope that Wilfried Brauer will consider these results for inclusion in the next edition of his textbook on automata theory [5].

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. A. V. Aho, J. E. Hopcroft and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1976.

    Google Scholar 

  2. R. F. Book and F. Otto. String-Rewriting Systems. Texts and Monographs in Computer Science. Springer, 1993.

    Google Scholar 

  3. A. Bouajjani and O. Maler. Reachability analysis of pushdown automata Proceedings of INFINITY '96, tech, rep. MIP-9614, Univ. Passau, 1996.

    Google Scholar 

  4. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model checking. To appear in CONCUR '97.

    Google Scholar 

  5. W. Brauer. Automatentheorie. Teubner, 1984.

    Google Scholar 

  6. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.

    Google Scholar 

  7. D. H. Younger. Recognition and parsing of context-free languages in time n 3. Information and Control, 10:189–208, 1967.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Technische Universität München, Arcisstr. 21, D-80290, München, Germany

    J. Esparza & P. Rossmanith

Authors
  1. J. Esparza
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Rossmanith
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Christian Freksa Matthias Jantzen Rüdiger Valk

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Esparza, J., Rossmanith, P. (1997). An automata approach to some problems on context-free grammars. In: Freksa, C., Jantzen, M., Valk, R. (eds) Foundations of Computer Science. Lecture Notes in Computer Science, vol 1337. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052083

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63746-2

  • Online ISBN: 978-3-540-69640-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation