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

  • Demen Güler
  • Andreas Krebs
  • Klaus-Jörn Lange
  • Petra Wolf
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10792)

Abstract

For a regular set R of quantified Boolean formulae we decide whether R contains a true formula. We conclude that there is a PSPACE-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.

Keywords

Automata and logic Emptiness of regular intersection Quantified Boolean formula PSPACE Polynomial hierarchy 

Notes

Acknowledgments

We thank Benjamin Gras for the fruitful discussions during the TüFTLeR seminar. Also, we give our thanks to Michaël Cadilhac, Silke Czarnetzki and Michael Ludwig for proof-reading.

References

  1. 1.
    Aho, A.V.: Indexed grammars—an extension of context-free grammars. J. ACM (JACM) 15(4), 647–671 (1968)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Calbrix, H., Knapik, T.: A string-rewriting characterization of Muller and Schupp’s context-free graphs. In: Arvind, V., Ramanujam, S. (eds.) FSTTCS 1998. LNCS, vol. 1530, pp. 331–342. Springer, Heidelberg (1998).  https://doi.org/10.1007/978-3-540-49382-2_31 CrossRefGoogle Scholar
  3. 3.
    Damm, W.: The IO- and OI-hierarchies. Theor. Comput. Sci. 20(2), 95–207 (1982)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Güler, D., Lange, K.J.: What is (Not) a Formal Language (in preparation)Google Scholar
  5. 5.
    Krebs, A., Lange, K.-J.: Dense completeness. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol. 7410, pp. 178–189. Springer, Heidelberg (2012).  https://doi.org/10.1007/978-3-642-31653-1_17 CrossRefGoogle Scholar
  6. 6.
    Krebs, A., Lange, K.-J., Ludwig, M.: On distinguishing NC\(^1\) and NL. In: Potapov, I. (ed.) DLT 2015. LNCS, vol. 9168, pp. 340–351. Springer, Cham (2015).  https://doi.org/10.1007/978-3-319-21500-6_27 CrossRefGoogle Scholar
  7. 7.
    Lange, K.J.: Complexity and structure in formal language theory. Fundam. Inform. 25(3, 4), 327–352 (1996)MathSciNetMATHGoogle Scholar
  8. 8.
    Stockmeyer, L.J.: The polynomial-time hierarchy. Theor. Comput. Sci. 3(1), 1–22 (1976)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time (preliminary report). In: Proceedings of the Fifth Annual ACM Symposium on Theory of Computing, pp. 1–9. ACM (1973)Google Scholar
  10. 10.
    Van Leeuwen, J.: The membership question for ETOL-languages is polynomially complete. Inf. Process. Lett. 3(5), 138–143 (1975)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Wrathall, C.: Complete sets and the polynomial-time hierarchy. Theor. Comput. Sci. 3(1), 23–33 (1976)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Demen Güler
    • 1
  • Andreas Krebs
    • 1
  • Klaus-Jörn Lange
    • 1
  • Petra Wolf
    • 1
  1. 1.Wilhelm-Schickard-InstitutUniversität TübingenTübingenGermany

Personalised recommendations