Embedding rule independent theory of graph grammars
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 wordsSequential vertex-replacing graph grammars general theory order independence
Unable to display preview. Download preview PDF.
- J. Hopcroft, J. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison Wesley, Reading, Mass. 1979.Google Scholar
- D. Janssens, G. Rozenberg, Graph Grammars with Node-Label Controlled Rewriting and Embedding, Lecture Notes in Computer Science 153, 186–205, 1982.Google Scholar
- H-J. Kreowski, A Pumping Lemma For Context-Free Graph Languages, Lecture Notes in Computer Science 73, 270–283, 1979.Google Scholar
- 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