Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Language and Automata Theory and Applications (LATA 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Aho, A.V.: Indexed grammars—an extension of context-free grammars. J. ACM (JACM) 15(4), 647–671 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  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

    Chapter  Google Scholar 

  3. Damm, W.: The IO- and OI-hierarchies. Theor. Comput. Sci. 20(2), 95–207 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  4. Güler, D., Lange, K.J.: What is (Not) a Formal Language (in preparation)

    Google Scholar 

  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

    Chapter  Google Scholar 

  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

    Chapter  Google Scholar 

  7. Lange, K.J.: Complexity and structure in formal language theory. Fundam. Inform. 25(3, 4), 327–352 (1996)

    MathSciNet  MATH  Google Scholar 

  8. Stockmeyer, L.J.: The polynomial-time hierarchy. Theor. Comput. Sci. 3(1), 1–22 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  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. Van Leeuwen, J.: The membership question for ETOL-languages is polynomially complete. Inf. Process. Lett. 3(5), 138–143 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  11. Wrathall, C.: Complete sets and the polynomial-time hierarchy. Theor. Comput. Sci. 3(1), 23–33 (1976)

    Article  MathSciNet  MATH  Google Scholar 

Download references

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.

Author information

Authors and Affiliations

  1. Wilhelm-Schickard-Institut, Universität Tübingen, Sand 13, 72076, Tübingen, Germany

    Demen Güler, Andreas Krebs, Klaus-Jörn Lange & Petra Wolf

Authors
  1. Demen Güler
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andreas Krebs
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Klaus-Jörn Lange
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Petra Wolf
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Demen Güler .

Editor information

Editors and Affiliations

  1. Bar-Ilan University, Ramat Gan, Israel

    Shmuel Tomi Klein

  2. Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  3. Ariel University, Ariel, Israel

    Dana Shapira

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Güler, D., Krebs, A., Lange, KJ., Wolf, P. (2018). Deciding Regular Intersection Emptiness of Complete Problems for PSPACE and the Polynomial Hierarchy. In: Klein, S., Martín-Vide, C., Shapira, D. (eds) Language and Automata Theory and Applications. LATA 2018. Lecture Notes in Computer Science(), vol 10792. Springer, Cham. https://doi.org/10.1007/978-3-319-77313-1_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-77313-1_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-77312-4

  • Online ISBN: 978-3-319-77313-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation