String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing (Q1089809)
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: String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing |
scientific article; zbMATH DE number 4005636
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing |
scientific article; zbMATH DE number 4005636 |
Statements
String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing (English)
0 references
1987
0 references
The complexity of languages generated by so-called context-free string grammars with disconnecting is investigated. The result is then applied to a number of graph grammar models with finite Church Rosser property. In particular, it is shown that these graph grammars can generate NP- complete languages.
0 references
complexity of languages
0 references
graph grammar
0 references
finite Church Rosser property
0 references
NP-complete languages
0 references
0 references
0.8537635
0 references
0 references
0.84467816
0 references
0.8432929
0 references
0.84235764
0 references
