Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1994: Mathematical Foundations of Computer Science 1994 pp 494–503Cite as

Empty alternation

  • Contributions
  • Conference paper
  • First Online:

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

Abstract

We introduce the notion of empty alternation by investigating alternating automata which are restricted to empty their storage except for a logarithmically space-bounded tape before making an alternating transition. In particular, we consider the cases when the depth of alternation is bounded by a constant or a polylogarithmic function. In this way we get new characterizations of the classes AC k, SACk and P using a push-down store and new characterizations of the class Θ p2 using Turing tapes.

This research was supported by DFG-SFB 342, Teilprojekt A4 “KLARA ”.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Balcázar and J. Diáz and J. Gabárro: Structural Complexity Theory I; Springer 1988.

    Google Scholar 

  2. J. Balcázar and J. Diáz and J. Gabárro: Structural Complexity Theory II; Springer 1990.

    Google Scholar 

  3. A.Borodin. S.A. Cook, P.W.Dymond, W.L. Ruzzo, M.Tompa; Two applications of complementation via inductive counting, 3rd Structure in Complexity Theory.

    Google Scholar 

  4. G. Buntrock: On the Robustness of the Polynomial Time Hierarchy, Technische Universität Berlin, Technischer Bericht, Nr.: 87–11,1987.

    Google Scholar 

  5. A.K. Chandra, D.C. Kozen, L.J. Stockmeyer; Alternation, Journ. of the ACM 28, 1 (1981), 114–133.

    Google Scholar 

  6. S.A. Cook: Characterizations of push-down machines in terms of time bounded computers, Journ. of the ACM 18, 1 (1971), 4–18.

    Google Scholar 

  7. Z.-Z. Chen, S. Toda: Grammatical Characterizations of P and PSPACE, transactions of the IEICE, Sep. 1990.

    Google Scholar 

  8. J.E. Hopcroft, J.D. Ullmam: Introduction to Automata Theory, Languages and Computation, Addison-Wesley, 1979.

    Google Scholar 

  9. N. Immerman: Nondeterministic space is closed under complementation, SIAM Journ. Comput. 15, 5 (1988), 935–938.

    Google Scholar 

  10. B. Jenner, B. Kirsig: Characterizing the polynomial hierarchy by alternating auxiliary push-down automata. Theoretical Informatics and Applications, 1989, 87–99.

    Google Scholar 

  11. B. Jenner, B. Kirsig, K.-J. Lange: The Logarithmic Alternation Hierarchy Collapses, Information and Computation 80 (1989), 269–288.

    Google Scholar 

  12. R. Ladner and N. Lynch: Relativization of questions about log space computability, Math. Systems Theory 10 (1976), 19–32.

    Google Scholar 

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

    Google Scholar 

  14. K.-J. Lange: Two Characterizations of the Logarithmic Alternation Hierarchy, Proc. of 12th MFCS 233, LNCS, Springer 1986, 518–526.

    Google Scholar 

  15. E. Moriya: A grammatical characterization of alternating push-down automata, TCS 67 (1989), 75–85.

    Google Scholar 

  16. K. Reinhardt: Hierarchien mit alternierenden Kellerautomaten, alternierenden Grammatiken und finiten Transducern, Diplomarbeit, Universität Stuttgart, 1989.

    Google Scholar 

  17. K. Reinhardt: Hierarchies over the context-free Languages, Proc. of 6th IMYCS, LNCS, 464, Springer 1990, 214–224.

    Google Scholar 

  18. K. Reinhardt. Counting and empty alternating pushdown automata, Proc. of 7th IMYCS, pages 198–207, Smolenice Castle, Tschechoslowakei, 1992.

    Google Scholar 

  19. W. Ruzzo and J. Simon and M. Tompa: Space — Bounded hierarchies and probabilistic computations, JCSS 28 (1984), 216–230.

    Google Scholar 

  20. R. Szelepcsenyi: The Method of forced enumeration for nondeterministic automata, Acta Informatica 26 (1988), 96–100.

    Google Scholar 

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

    Google Scholar 

  22. K. Wagner. Bounded query classes. SIAM Journ. Comput. 19 (1990), 833–846.

    Google Scholar 

  23. H. Venkateswaran: Properties that characterize LOGCFL. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 141–150, New York, May 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, TU München, Arcisstr. 21, D-80290, München

    Klaus-Jörn Lange

  2. Institut für Informatik, Universität Stuttgart, Breitwiesenstr. 22, D-70565, Stuttgart

    Klaus Reinhardt

Authors
  1. Klaus-Jörn Lange
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Klaus Reinhardt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Igor Prívara Branislav Rovan Peter Ruzička

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lange, KJ., Reinhardt, K. (1994). Empty alternation. In: Prívara, I., Rovan, B., Ruzička, P. (eds) Mathematical Foundations of Computer Science 1994. MFCS 1994. Lecture Notes in Computer Science, vol 841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58338-6_96

Download citation

  • DOI: https://doi.org/10.1007/3-540-58338-6_96

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58338-7

  • Online ISBN: 978-3-540-48663-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation