Membership for growing context-sensitive grammars is polynomial (Q579948): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
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.
Property / review text: 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. / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q45 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 4016213 / rank
 
Normal rank
Property / zbMATH Keywords
 
context-sensitive grammar
Property / zbMATH Keywords: context-sensitive grammar / rank
 
Normal rank
Property / zbMATH Keywords
 
membership problem
Property / zbMATH Keywords: membership problem / rank
 
Normal rank

Revision as of 17:33, 1 July 2023

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
    0 references
    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

    Identifiers