Power properties of NLC graph grammars with a polynomial membership problem (Q1129012)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Power properties of NLC graph grammars with a polynomial membership problem |
scientific article; zbMATH DE number 1190162
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Power properties of NLC graph grammars with a polynomial membership problem |
scientific article; zbMATH DE number 1190162 |
Statements
Power properties of NLC graph grammars with a polynomial membership problem (English)
0 references
13 August 1998
0 references
graph grammars
0 references
graph parsing
0 references
membership problem
0 references
0 references
0.8665053844451904
0 references
0.8324490189552307
0 references
