On labelled graph grammars

@article{Levy1978OnLG,
  title={On labelled graph grammars},
  author={Leon S. Levy and Kang Yueh},
  journal={Computing},
  year={1978},
  volume={20},
  pages={109-125}
}
According to the classification of labelled graph grammars by Nagl [4], it can be shown that the class of context-sensitive graph languages is equivalent to the class of context-free graph languages and the context-free graph languages properly include the regular graph languages. Mit der Klassifikation der Markierten Graph-Grammatiken von Nagl [4] kann man… CONTINUE READING