On the membership problem for regular DNLC grammars (Q1082088): Difference between revisions

There are (at least) three motivations to study the class of regular directed node-label controlled graph grammars (regular DNLC grammars for short): (1) it fits very well into the hierarchy of subclasses of DNLC grammars, (2) it generalizes naturally right-linear string grammars and (3) it provides a useful framework for the theory of concurrent systems based on the theory of traces. The complexity of (the membership problem for) the class of regular DNLC grammars is investigated.