Deciding regular intersection emptiness of complete problems for PSPACE and the polynomial hierarchy (Q1647695)

From MaRDI portal
Revision as of 23:36, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Deciding regular intersection emptiness of complete problems for PSPACE and the polynomial hierarchy
scientific article

    Statements

    Deciding regular intersection emptiness of complete problems for PSPACE and the polynomial hierarchy (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 June 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    automata and logic
    0 references
    emptiness of regular intersection
    0 references
    quantified Boolean formula
    0 references
    PSPACE
    0 references
    polynomial hierarchy
    0 references
    0 references