The computational complexity of certain graph grammars
This paper contributes to the theory of graph grammars, studying the generated languages of graphs from the viewpoint of complexity theory. To this respect we naturally bridge the gap between graphs and strings. A string is identified with a graph which is an oriented chain, and conversely, a representation of a graph, e.g., by its adjacency matrix, is a well-structured string. Our main result states that context-free respectively monotone graph grammars in the approach developed by Nagl  precisely have the computational power of n2-space-bounded nondeterministic Turing machines, and for this result there is no difference between directed and undirected graphs respectively graph grammars.
Unable to display preview. Download preview PDF.
- V. Claus, H. Ehrig, and G. Rozenberg (Eds.) Graph grammars and their application to computer science and biology. Lecture Notes in Computer Science, Vol. 73 (1979).Google Scholar
- F. Harary, and E.M. Palmer Graphical Enumeration. Academic Press, New York, 1973.Google Scholar
- J.E. Hopcroft, and J.D. Ullman Introduction to Automata Theory, Languages and Computation. Addison Wesley, Reading, 1979.Google Scholar
- D. Janssens, and G. Rozenberg A characterization of context-free string languages by directed node label controlled graph grammars. Acta Inform. 16 (1981), 63–85.Google Scholar
- M. Nagl Graph-Grammatiken. Vieweg, Braunschweig, 1979.Google Scholar