Membership for growing context-sensitive grammars is polynomial (Q579948)
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: Publication:579948 |
scientific article; zbMATH DE number 4016213
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Membership for growing context-sensitive grammars is polynomial |
scientific article; zbMATH DE number 4016213 |
Statements
Membership for growing context-sensitive grammars is polynomial (English)
0 references
1986
0 references
A context-sensitive grammar is a growing context-sensitive grammar, if the right-hand side of every production is strictly longer than the left- hand side. We show that for any fixed growing context sensitive grammar, the membership problem for the corresponding language is polynomial.
0 references
context-sensitive grammar
0 references
membership problem
0 references
0.8636260628700256
0 references
0.8437442183494568
0 references
0.8175210952758789
0 references
