Skip to main content
SpringerLink
Log in

Recognizing rooted context-free flowgraph languages in polynomial time

  • Conference paper
  • First Online:
Graph Grammars and Their Application to Computer Science (Graph Grammars 1990)

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

Abstract

We introduce context-free flowgraph grammars, which allow to replace single vertices together with their outgoing edges, thereby using the basic embedding idea of the algebraic graph grammar approach. For a naturally defined subclass of these, called the rooted grammars, an algorithm is presented which solves the language recognizing problem in time polynomial in the number of vertices of the input graphs.

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. Claus, V., Ehrig, H., Rozenberg, G. (eds.): Graph-Grammars and Their Application to Computer Science and Biology, LNCS 73, 1979.

    Google Scholar 

  2. Earley, J.: An Efficient Context-Free Parsing Algorithm, Comm. ACM, Vol. 13, No. 2, 1970, 94–102.

    Article  Google Scholar 

  3. Ehrig, H., Nagl, M., Rozenberg, G. (eds.): Graph Grammars and Their Application to Computer Science, LNCS153, 1983.

    Google Scholar 

  4. Ehrig, H., Pfender, M., Schneider, H.J.: Graph Grammars: An Algebraic Approach, Proc. 14th Annual IEEE Symposium on Switching and Automata Theory, 1973, 167–180.

    Google Scholar 

  5. Ehrig, H., Nagl, M., Rozenberg, G., Rosenfeld, A. (eds.): Graph-Grammars and Their Application to Computer Science, LNCS 291, 1987.

    Google Scholar 

  6. Farrow, R., Kennedy, K., Zucconi, L.: Graph Grammars and Global Program Data Flow Analysis, Proc. 17th Annual IEEE Symposium on Foundations of Computer Science, 1976, 42–56.

    Google Scholar 

  7. Habel, A.: Hyperedge Replacement: Grammars and Languages. Ph. D. Thesis, University of Bremen, 1989.

    Google Scholar 

  8. Kaul, M.: Syntaxanalyse von Graphen bei Präzedenz-Graph-Grammatiken. Ph. D. Thesis, University of Passau, 1986.

    Google Scholar 

  9. Lautemann, C.: The complexity of graph languages generated by hyperedge replacement. Report No. 4/89, Fachbereich Mathematik und Informatik, University of Bremen, 1989.

    Google Scholar 

  10. Lichtblau, U.: Decompilation of Control Structures by Means of Graph Transformations LNCS 185, 1985, 284–297.

    Google Scholar 

  11. Lichtblau,U.: Flußgraphgrammatiken. Ph. D. Thesis, University of Oldenburg, 1990.

    Google Scholar 

  12. McCreary, C.L.: An Algorithm for Parsing a Graph Grammar. Ph. D. Thesis, University of Colorado, 1987.

    Google Scholar 

  13. Schuster, R.: Graphgrammatiken und Grapheinbettungen: Algorithmen und Komplexität. Ph. D. Thesis, University of Passau, 1987.

    Google Scholar 

  14. Slisenko, A.O.: Context-Free Graph Grammars as a Tool for Describing Polynomial-time Subclasses of Hard Problems, Information processing Letters 14, 1982, 52–56.

    Article  Google Scholar 

  15. Vogler, W.: Recognizing Edge Replacement Graph Languages in Cubic Time. Report TUM-19017, Technical University of Munich, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Universität Oldenburg, Postfach 2503, D-2900, Oldenburg, F.R.Germany

    Ulrike Lichtblau

Authors
  1. Ulrike Lichtblau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hartmut Ehrig Hans-Jörg Kreowski Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lichtblau, U. (1991). Recognizing rooted context-free flowgraph languages in polynomial time. In: Ehrig, H., Kreowski, HJ., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1990. Lecture Notes in Computer Science, vol 532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017411

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54478-4

  • Online ISBN: 978-3-540-38395-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation