On the relation of graph grammars and graph automata

Abstract

It is shown that a strong relationship exists between sets of graphs defined by graph (walking) automata with markers available and sets defined by graph grammars. Polynomial recognition algorithms are presented for certain classes of sets and it is argued that the existence of polynomial algorithms for other classes is doubtful. Other properties of the classes of sets defined by graph automata and graph grammars are also studied.