Linear Graph Grammars: Power and Complexity

@article{Engelfriet1989LinearGG,
  title={Linear Graph Grammars: Power and Complexity},
  author={Joost Engelfriet and George Leih},
  journal={Inf. Comput.},
  year={1989},
  volume={81},
  pages={88-121}
}
A graph grammar is linear if it generates graphs with at most one nonterminal node. Linear graph grammars can simulate nonterminal bounded graph grammars (which generate graphs with a bounded number of nonterminal nodes) and derivation bounded graph grammars. If a linear graph language contains connected graphs of bounded degree only, then it is in NSPACE(logn). These results are shown for graph grammars with neighbourhood controlled embedding and with dynamic edge relabeling (eNCE grammars). f… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 30 references

The Complexity of Regular DNLC Graph Languages.

  • G. 1986a
  • Leiden. See also EHRIG et al
  • 1987
Highly Influential
13 Excerpts

Syntaxanalyse von Graphen bei Prtiedenz-Graph-Grammatiken,

  • M. KAUL
  • Ph.D. thesis, University of Osnabriick. LAUTEMANN…
  • 1985
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…