Abstract
The alternation hierarchy for two-way Turing machines with a space bound in o(log) does not collapse below level five.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
L. Babai and S. Moran. Arthur-Merlin games: a randomized proof-system, and a hierarchy of complexity classes. Journal of Computer and System Sciences 36 (1988) 254–276, 36:254–276, 1988.
B. v. Braunmühl. Alternationshierarchien von Turingmaschinen mit kleinem Speicher. Informatik Berichte 83, Inst. für Informatik, Universität Bonn, 1991.
J. Hastad. Almost optimal lower bounds for small depth circuits. In Proc. 18. STOC, pages 6–20, 1986.
L. A. Hemachandra. The strong exponential hierarchy collapses. In Proc. 19th. STOC Conference, pages 110–122, 1987.
A. Ito, K. Inoue, and I. Takanami. A note on alternating Turing machines using small space. The Transactions of the IEICE, E 70 no. 10:990–996, 1987.
N. Immerman. NSPACE is closed under complement. SIAM J. Comput., 17:935–938, 1988.
M. Liśkiewicz and K. Loryś. On reversal complexity for alternating Turing machines. In Proc. 30st Ann. Symp. on Foundations of Computer Science, pages 618–623, 1989.
P. M. Lewis, R. E. Stearns, and J. Hartmanis. Memory bounds for recognition of context-free and context-sensitive languages. In IEEE Conf. Switch. Circuit Theory and Logic Design, pages 191–202, 1965.
U. Schöning and K. W. Wagner. Collapsing oracle hierarchies, census functions and logarithmically many queries. In Proc. 5th. STACS 88, LNCS 294, pages 91–97, 1988.
R. Szelepcsényi. The method of forced enumeration for nondeterministic automata. Acta Informatica, 26:279–284, 1988.
A. Yao. Separating the polynomial time hierarchy by oracles. In Proc. 26th. FoCS, pages 1–10, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
von Braunmühl, B. (1993). Alternation for two-way machines with sublogarithmic space. 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_3
Download citation
DOI: https://doi.org/10.1007/3-540-56503-5_3
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