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

From MaRDI portal
Created claim: Wikidata QID (P12): Q60307679, #quickstatements; #temporary_batch_1711055989931
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3292904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-bounded grammars and their languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of context-sensitive grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of formal grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3727407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5518372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern selector grammars and several parsing algorithms in the context- free style / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of scheduling theory to formal language theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Manipulating derivation forests by scheduling techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scattered versus context-sensitive rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scattered context grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of languages and linear-bounded automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parsing for general phrase-structure grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-size bounded alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5180413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Tape Complexity of Deterministic Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel complexity of logical query programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition and parsing of context-free languages in time n3 / rank
 
Normal rank

Revision as of 11:14, 18 June 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
    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