The complexity of regular DNLC graph languages (Q909473): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0022-0000(90)90004-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2030288301 / rank | |||
Normal rank | |||
Revision as of 00:41, 20 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
