1 paper
Frank Drewes, Berthold Hoffmann, Mark Minas
Engelfriet and Vereijken have shown that linear graph grammars based on hyperedge replacement generate graph languages that can be considered as interpretations of regular string l…