Deciding regular intersection emptiness of complete problems for PSPACE and the polynomial hierarchy (Q1647695)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Deciding regular intersection emptiness of complete problems for PSPACE and the polynomial hierarchy |
scientific article; zbMATH DE number 6894747
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deciding regular intersection emptiness of complete problems for PSPACE and the polynomial hierarchy |
scientific article; zbMATH DE number 6894747 |
Statements
Deciding regular intersection emptiness of complete problems for PSPACE and the polynomial hierarchy (English)
0 references
26 June 2018
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
