Embedding rule independent theory of graph grammars

  • Janice Jeffs
Part II Technical Contributions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 291)


Recently the general theory of graph grammars has become a growing area of research. Some properties which hold for all sequential, vertex-replacing graph grammars (without erasing) are presented, including a vertex pumping lemma. A construction is described which proves the undecidability of the question whether a graph grammar has the following property: changing the order of application of the productions in a derivation does not change the graph produced. Classes of graph grammars for which this property can be decided are presented. They include the NLC graph grammars of Janssens and Rozenberg [4,5].

Key words

Sequential vertex-replacing graph grammars general theory order independence 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    C.R. Cook, First Order Graph Grammars, SIAM J. Comput. Vol.3, No.1, 90–99, 1974.CrossRefGoogle Scholar
  2. [2]
    A. Ehrenfeucht, M. Main, G. Rozenberg, Restrictions on NLC Graph Grammars, Theoretical Computer Science 31: 211–223, 1984.CrossRefGoogle Scholar
  3. [3]
    J. Hopcroft, J. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison Wesley, Reading, Mass. 1979.Google Scholar
  4. [4]
    D. Janssens, G. Rozenberg, On the Structure of Node-Label-Controlled Graph Languages, Information Science, 20: 191–216, 1980.CrossRefGoogle Scholar
  5. [5]
    D. Janssens, G. Rozenberg, Restrictions, Extensions, and Variations of NLC Grammars, Information Science, 20: 217–244, 1980.CrossRefGoogle Scholar
  6. [6]
    D. Janssens, G. Rozenberg, Graph Grammars with Node-Label Controlled Rewriting and Embedding, Lecture Notes in Computer Science 153, 186–205, 1982.Google Scholar
  7. [7]
    H-J. Kreowski, A Pumping Lemma For Context-Free Graph Languages, Lecture Notes in Computer Science 73, 270–283, 1979.Google Scholar
  8. [8]
    E. Welzl, Encoding Graphs by Derivations and Implications for the Theory of Graph Grammars, Lecture Notes in Computer Science 172, 503–513, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Janice Jeffs
    • 1
  1. 1.Department of Mathematics and StatisticsCarleton UniversityOttawaCanada

Personalised recommendations