Characterizing the polynomial hierarchy by alternating auxiliary pushdown automata (Q3816981): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W344542471 / 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: Alternation / 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: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Space is Closed under Complementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3766852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Pushdown and Stack Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation bounded auxiliary pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3793733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / 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: Q3815544 / rank
 
Normal rank

Latest revision as of 14:16, 19 June 2024

scientific article
Language Label Description Also known as
English
Characterizing the polynomial hierarchy by alternating auxiliary pushdown automata
scientific article

    Statements

    Characterizing the polynomial hierarchy by alternating auxiliary pushdown automata (English)
    0 references
    0 references
    0 references
    1989
    0 references
    0 references
    0 references
    0 references
    0 references
    complexity theory
    0 references
    alternating auxiliary pushdown hierarchy
    0 references
    machine model
    0 references
    logarithmic alternation hierarchy
    0 references
    pushdown store
    0 references
    PSPACE
    0 references
    pushdown automata with unbounded alternation
    0 references
    0 references