Membership for growing context-sensitive grammars is polynomial (Q579948): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/jcss/DahlhausW86, #quickstatements; #temporary_batch_1731530891435 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jcss/DahlhausW86 / rank | |||
Normal rank | |||
Latest revision as of 21:54, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Membership for growing context-sensitive grammars is polynomial |
scientific article |
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
