String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing (Q1089809): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:10, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing |
scientific article |
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
