The complexity of regular DNLC graph languages (Q909473): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Revision as of 02:35, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of regular DNLC graph languages |
scientific article |
Statements
The complexity of regular DNLC graph languages (English)
0 references
1990
0 references
graph grammars
0 references
dependence graph languages
0 references
event structure languages
0 references
complexity of the membership problem
0 references
