On the membership problem for regular DNLC grammars (Q1082088): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57402294, #quickstatements; #temporary_batch_1708039819900 |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:07, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the membership problem for regular DNLC grammars |
scientific article |
Statements
On the membership problem for regular DNLC grammars (English)
0 references
1986
0 references
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.
0 references
regular directed node-label controlled graph grammars
0 references
complexity
0 references
membership problem
0 references
