Skip to main content
Conference Proceedings

Alternation for two-way machines with sublogarithmic space

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1993) 665 LNCS 5-15
DOI: 10.1007/3-540-56503-5_3
2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The alternation hierarchy for two-way Turing machines with a space bound in o(log) does not collapse below level five.

Cite

CITATION STYLE

APA

von Braunmühl, B. (1993). Alternation for two-way machines with sublogarithmic space. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 665 LNCS, pp. 5–15). Springer Verlag. https://doi.org/10.1007/3-540-56503-5_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free