On the membership problem for regular DNLC grammars (Q1082088): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0166-218x(86)90070-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2029471547 / rank | |||
Normal rank | |||
Latest revision as of 10:11, 30 July 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
0 references
0 references
