The complexity of the membership problem for some extensions of context-free languagest† (Q4181980): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q791315
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Ivan Hal Sudborough / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/00207167708803138 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2056449710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programmed Grammars and Classes of Formal Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-way stack automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The membership question for ETOL-languages is polynomially complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking automata and one-way stack languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4062662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-bounded reducibility among combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: General context-free recognition in less than cubic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hardest Context-Free Language / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tape-complexity of context-independent developmental languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: AFL with the semilinear property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple matrix languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric hierarchy of languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy between context-free and context-sensitive languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On vector languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Control sets on grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Overview of the Theory of Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic context free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of Pushdown Machines in Terms of Time-Bounded Computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-Turn Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two-way multihead automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-tape and multi-head pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periodically time-variant context-free grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix grammars with a leftmost restriction / rank
 
Normal rank
Property / cites work
 
Property / cites work: On matrix languages / rank
 
Normal rank

Latest revision as of 00:23, 13 June 2024

scientific article; zbMATH DE number 3619335
Language Label Description Also known as
English
The complexity of the membership problem for some extensions of context-free languagest†
scientific article; zbMATH DE number 3619335

    Statements

    The complexity of the membership problem for some extensions of context-free languagest† (English)
    0 references
    1977
    0 references
    Extensions of Context-Free Languages
    0 references
    Complexity
    0 references
    Membership Problem
    0 references
    Recognition Problem
    0 references
    Pushdown Automata
    0 references
    Eol Languages
    0 references
    Edol Languages
    0 references
    Homomorphic Replication
    0 references
    Regular Set
    0 references
    State Grammars
    0 references
    Vector Grammars
    0 references

    Identifiers