Skip to main content
SpringerLink
Log in

Editorial note

The alternation hierarchy for sublogarithmic space: An exciting race to STACS'93

  • Conference paper
  • First Online:
Book cover STACS 93 (STACS 1993)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. Braunmühl, B. von, Alternationshietarchien von Turingmaschinen mit kleinem Speicher, habilitation thesis, Bonn, Juni 1991.

    Google Scholar 

  2. Braunmühl, B. von, Alternation for two-way machines with sublogarithmic space, this volume.

    Google Scholar 

  3. Braunmühl, B. von, Gengler, R., Rettinger, R., The alternation hierarchy for two-way machines with sublogarithmic space is infinite, abstract, December 1992.

    Google Scholar 

  4. Chang, J.H., Ibarra, O.H., Ravikumar, B., Berman, L., Some observations concerning alternating Turing machines using small space, IPL 25 (1987), 1–9; Erratum 27 (1988), 53.

    Google Scholar 

  5. Geffert, V., Nondeterministic computations in sublogarithmic space and space constructibility, SIAM J. Comput. 20 (1991), 484–498.

    Google Scholar 

  6. Geffert, V., Sublogarithmic Σ 2-space is not closed under complementation and other separation results, technical report, Šafárik University, Košice 1992.

    Google Scholar 

  7. Immerman, N., Nondeterministic space is closed under complementation, SIAM J. Comput. 7 (1988), 935–938.

    Google Scholar 

  8. Ito, A., Inoue, K., Takanami, I., A note on alternating Turing machines using small space. The Transactions of the IEICE E 70 no. 10, (1987), 990–996.

    Google Scholar 

  9. Iwama, K., ASPACE(o(loglog)) is regular, research report, KSU/ICS Kyoto Sangyo University, Kyoto 1986.

    Google Scholar 

  10. Liśkiewicz, M., Reischuk, R., Separating the lower levels of the sublogarithmic space hierarchy, manuscript, summer 92 (submitted to STACS'93).

    Google Scholar 

  11. Liśkiewicz, M., Reischuk, R., The sublogarithmic space hierarchy is infinite, extended abstract, December 1992.

    Google Scholar 

  12. Liśkiewicz, M., Reischuk, R., Separating the lower levels of the sublogarithmic space hierarchy, this volume.

    Google Scholar 

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

    Google Scholar 

Download references

Authors
  1. Klaus W. Wagner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

P. Enjalbert A. Finkel K. W. Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wagner, K.W. (1993). Editorial note. In: Enjalbert, P., Finkel, A., Wagner, K.W. (eds) STACS 93. STACS 1993. Lecture Notes in Computer Science, vol 665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56503-5_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-56503-5_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation