Skip to main content
SpringerLink
Log in

A pumping lemma for context-free graph languages

  • List Of Contributions
  • Conference paper
  • First Online:
Graph-Grammars and Their Application to Computer Science and Biology (Graph Grammars 1978)

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

Abstract

Each sufficiently large graph belonging to a context-free graph language (generated by an edge-replacement system) can be decomposed in three subgraphs FIRST, LINK and LAST, such that a suitable chain gluing of FIRST, LAST and N examples of LINK for each natural number N is also member of the language. This generalization of the well-known pumping lemma (also called Bar-Hillel's lemma, uvwxy lemma etc.) for context-free Chomsky languages is formulated and proved, where the iteration of LINK in the chain gluing leads to the pumping effect. The proof is based in canonical derivations and the embedding theorems studied in the algebraic theory of graph grammars.

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. Culik, K. II/ Wood, D.: A Mathematical Investigation of Parallel Graph OL-Systems, this volume

    Google Scholar 

  2. Della Vigna, P./ Ghezzi, C.: Context-free Graph Grammars, Inf. Contr. 37, 207–233 (1978)

    Google Scholar 

  3. Ehrig, H.: Introduction to the Algebraic Theory of Graph Grammars, this volume

    Google Scholar 

  4. Ehrig, H./ Liedtke, A.: Locally Star Gluing Formulas for a Class of Parallel Graph Grammars, this volume

    Google Scholar 

  5. Franck, R.: A Class of Linearly Parsable Graph-Grammars, Acta Informatica 10, 175–201 (1978)

    Google Scholar 

  6. Heibey, H.W.: Ein Modell zur Behandlung Mehrdimensionaler Strukturen unter Berücksichtigung der in ihnen definierten Lagerelationen, Report No. 15, University of Hamburg, (1975)

    Google Scholar 

  7. Hopcroft, J.E./ Ullman, J.D.: Formal Languages and their Relation to Automata, Addison-Wesley 1969

    Google Scholar 

  8. Kreowski, H.-J.: Ein Pumping Lemma für kanten-kontextfreie Graph-Sprachen, Techn. Rep. 77-15, FB 20, TU Berlin (1977)

    Google Scholar 

  9. —: Manipulationen von Graphenmanipulationen, Dissertation, FB Informatik, TU Berlin (1977)

    Google Scholar 

  10. Nagl, M.: Graph-Ersetzungssysteme: Theorie, Anwendungen, Implementierung, Habilitationsschrift, University of Erlangen (1978)

    Google Scholar 

  11. —: A Tutorial and Bibliographical Survey on Graph Grammars, this volume

    Google Scholar 

  12. Pratt, T.: Pair Grammars, Graph Languages and String-to-Graph Translations, Journ. Comp. Syst. Sci. 5, 560–595, (1971)

    Google Scholar 

  13. Wagner, K.: Graphentheorie, Bibliographisches Institut, Mannheim 1970

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Universität Berlin, Germany

    Hans-Jörg Kreowski

Authors
  1. Hans-Jörg Kreowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Volker Claus Hartmut Ehrig Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kreowski, HJ. (1979). A pumping lemma for context-free graph languages. In: Claus, V., Ehrig, H., Rozenberg, G. (eds) Graph-Grammars and Their Application to Computer Science and Biology. Graph Grammars 1978. Lecture Notes in Computer Science, vol 73. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0025726

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09525-5

  • Online ISBN: 978-3-540-35091-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation