Skip to main content
SpringerLink
Log in

Alternating and Empty Alternating Auxiliary Stack Automata

  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 2000 (MFCS 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1893))

Abstract

We consider variants of alternating auxiliary stack automata and characterize their computational power when the number of alternations is bounded by a constant or unlimited. In this way we get new characterizations of NP, the polynomial hierarchy, PSpace, and bounded query classes like NL 〈 NP[1]〉 and Θ2 P = P NP[O(logn)], in a uniform framework.

Supported by the National Sciences and Engineering Research Council (NSERC) of Canada and by the Fonds pour la Formation de Chercheurs et l’Aide á la Recherche (FCAR) of Québec.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. Journal of the ACM, 28(1):114–133, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  2. S.A. Cook. Characterizations of pushdown machines in terms of time-bounded computers. Journal of the ACM, 18(1):4–18, 1971.

    Article  MATH  Google Scholar 

  3. O. H. Ibarra. Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata. Journal of Computer and System Sciences, 5(2):88–117, 1971.

    MATH  MathSciNet  Google Scholar 

  4. N. Immerman. Nondeterministic space is closed under complementation. SIAM Journal on Computing, 17(5):935–938, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  5. B. Jenner and B. Kirsig. Characterizing the polynomial hierarchy by alternating auxiliary pushdown automata. In Proceedings of the 5th Annual Symposium on Theoretical Computer Science, number 294 in LNCS, pages 118–125, Bordeaux, France, 1988. Springer.

    Google Scholar 

  6. R. Ladner and N. Lynch. Relativization of questions about log space computability. Mathematical Systems Theory, 10:19–32, 1976.

    Article  MATH  MathSciNet  Google Scholar 

  7. R. E. Ladner, R. J. Lipton, and L. J. Stockmeyer. Alternating pushdown and stack automata. SIAM Journal on Computing, 13(1):135–155, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  8. R. E. Ladner, L. J. Stockmeyer, and R. J. Lipton. Alternation bounded auxiliary pushdown automata. Information and Control, 62:93–108, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  9. K.-J. Lange and K. Reinhardt. Empty alternation. In Proceedings of the 9th Conference on Mathematical Foundations of Computer Science, number 841 in LNCS, pages 494–503, Kosice, Slovakia, 1994. Springer.

    Google Scholar 

  10. W. L. Ruzzo, J. Simon, and M. Tompa. Space-bounded hierarchies and probabilistic computations. Journal of Computer and System Sciences, 28(2):216–230, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  11. I. H. Sudborough. On the tape complexity of deterministic context-free languages. Journal of the ACM, 25(3):405–414, 1978.

    Article  MATH  MathSciNet  Google Scholar 

  12. R. Szelepcsényi. The method of forced enumeration for nondeterministic automata. Acta Informatica, 26(3):279–284, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  13. K. Wagner and G. Wechsung. Computational Complexity. Mathematics and its applications (East Europeans series). VEB Deutscher Verlag der Wissenschaften, Berlin, 1986.

    Google Scholar 

  14. K. W. Wagner. Bounded query classes. SIAM Journal on Computing, 19(5):833–846, 1990.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département d’I.R.O., Université de Montréal, C.P. 6128, succ. Centre-Ville, Montréal (Québec), H3C3J7, Canada

    Markus Holzer & Pierre McKenzie

Authors
  1. Markus Holzer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierre McKenzie
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Aarhus, Ny Munkegade, Bldg. 540, 8000, Aarhus C, Denmark

    Mogens Nielsen

  2. Department of Computer Sciene, Comenius University, 84248, Bratislava, Slovakia

    Branislav Rovan

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Holzer, M., McKenzie, P. (2000). Alternating and Empty Alternating Auxiliary Stack Automata. In: Nielsen, M., Rovan, B. (eds) Mathematical Foundations of Computer Science 2000. MFCS 2000. Lecture Notes in Computer Science, vol 1893. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44612-5_37

Download citation

  • DOI: https://doi.org/10.1007/3-540-44612-5_37

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67901-1

  • Online ISBN: 978-3-540-44612-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation