Linear graph grammars: Power and complexity

https://doi.org/10.1016/0890-5401(89)90030-8Get rights and content
Under an Elsevier user license
open archive

Abstract

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).

Cited by (0)

The work of this author was conducted as part of the PRISMA project, a joint effort with Philips Research, partially supported by the Dutch “Stimuleringsprojectteam informaticaonderzoek” (SPIN).