Editorial note

The alternation hierarchy for sublogarithmic space: An exciting race to STACS'93
  • Klaus W. Wagner
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 665)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Bra91]
    Braunmühl, B. von, Alternationshietarchien von Turingmaschinen mit kleinem Speicher, habilitation thesis, Bonn, Juni 1991.Google Scholar
  2. [Bra93]
    Braunmühl, B. von, Alternation for two-way machines with sublogarithmic space, this volume.Google Scholar
  3. [BGR92]
    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. [CIRB87]
    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. [Gef91]
    Geffert, V., Nondeterministic computations in sublogarithmic space and space constructibility, SIAM J. Comput. 20 (1991), 484–498.Google Scholar
  6. [Gef92]
    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. [Imm88]
    Immerman, N., Nondeterministic space is closed under complementation, SIAM J. Comput. 7 (1988), 935–938.Google Scholar
  8. [IIT87]
    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. [Iwa86]
    Iwama, K., ASPACE(o(loglog)) is regular, research report, KSU/ICS Kyoto Sangyo University, Kyoto 1986.Google Scholar
  10. [LiRc92a]
    Liśkiewicz, M., Reischuk, R., Separating the lower levels of the sublogarithmic space hierarchy, manuscript, summer 92 (submitted to STACS'93).Google Scholar
  11. [LiRe92b]
    Liśkiewicz, M., Reischuk, R., The sublogarithmic space hierarchy is infinite, extended abstract, December 1992.Google Scholar
  12. [LiRe93]
    Liśkiewicz, M., Reischuk, R., Separating the lower levels of the sublogarithmic space hierarchy, this volume.Google Scholar
  13. [Sze88]
    Szelepcsényi, R., The method of forced enumeration for nondeterministic automata, Acta Informatica 26 (1988), 279–284.Google Scholar

Copyright information

© Springer-Verlag 1993

Authors and Affiliations

  • Klaus W. Wagner

There are no affiliations available

Personalised recommendations