Deciding Regular Intersection Emptiness of Complete Problems for PSPACE and the Polynomial Hierarchy.

For a regular set R of quantified Boolean formulae we decide whether R contains a true formula. We conclude that there is a P SPACE-complete problem for which emptiness of intersection with a regular set is decidable. Furthermore, by restricting depth and order of quantification we obtain complete problems for each level of the polynomial hierarchy with this decidability as well.