The sublogarithmic alternating space world

SIAM Journal on Computing

Volumn 25, Issue 4, 1996, Pages 828-861

  Liśkiewicz, Maciej ^a,b   Reischuk, Rüdiger ^a,c  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF WROC AW   (Poland)

^c UNIVERSITY OF LÜBECK   (Germany)

Author keywords

Alternating Turing machines; Bounded languages; Closure properties; Complementation of languages; Complexity hierarchies; Context free languages; Halting computations; Space complexity; Sublogarithmic complexity bounds

Indexed keywords

EID: 0000740572     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539793252444     Document Type: Article

References (26)

1. H. ALT, Lower bounds on space complexity for context-free recognition, Acta Inform., 12 (1979), pp. 33-61.
2. H. ALT, V. GEFFERT, AND K. MEHLHORN, A lower bound for the nondeterministic space complexity of context-free recognition, Inform. Process. Lett., 42 (1992), pp. 25-27.
3. H. ALT AND K. MEHLHORN, A language over a one symbol alphabet requiring only O(log log n) space, SIGACT Newslett., 1975, pp. 31-33.
4. _, Lower bounds for the space complexity of context free recognition, in Proc. 3rd International Colloquium on Automata, Languages, and Programming (ICALP), Lecture Notes in Comput. Sci., Springer-Verlag, Berlin, 1976, pp. 339-354.
5. B. VON BRAUNMÜHL, Alternation for two-way machines with sublogarithmic space, Proc. 10th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci., Springer-Verlag, Berlin, 1993, pp. 5-15.
6. B. VON BRAUNMÜHL, R. GENGLER, AND R. RETTINGER, The alternation hierarchy for machines with sublogarithmic space is infinite. Research report, Universität Bonn, Bonn, Germany, January, 1993.
7. J. CHANG, O. IBARRA, B. RAVIKUMAR, AND L. BERMAN, Some observations concerning alternating Turing machines using small space, Inform. Process Lett., 25 (1987), pp. 1-9.
8. V. GEFFERT, Nondeterministic computations in sublogarithmic space and space constructability, SIAM J. Comput., 20 (1991), pp. 484-498.
9. 2-space is not closed under complement and other separation results, Technical report, University of P. J. Šafárik, Košice, Slovakia, 1992.
10. _, Tally version of the Savitch and Immerman-Szelepcsényi theorems for sublogarithmic space, SIAM J. Comput., 22 (1993), pp. 102-113.
11. _, A hierarchy that does not collapse: Alternations in low level space, manuscript.
12. S. GINSBURG, The mathematical theory of context-free languages, McGraw-Hill, New York, 1972.
13. N. IMMERMAN, Nondeterministic space is closed under complementation, SIAM J. Comput., 17 (1988), pp. 935-938.
14. M. LIŚKIEWICZ AND R. REISCHUK, Separating the lower levels of the sublogarithmic space hierarchy, Technical report, Institut für Theoretische Informatik, Technische Hochschule Darmstadt, 1992; Proc. 10th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci., Springer-Verlag, Berlin, 1993, pp. 16-27.
15. M. LIŚKIEWICZ AND R. REISCHUK, Separating the lower levels of the sublogarithmic space hierarchy, Technical report, Institut für Theoretische Informatik, Technische Hochschule Darmstadt, 1992; Proc. 10th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci., Springer-Verlag, Berlin, 1993, pp. 16-27.
16. _, The sublogarithmic space hierarchy is infinite, Technical report, Institut für Theoretische Informatik, Technische Hochschule Darmstadt, Darmstadt, Germany, 1993.
17. B. LITOW, On efficient deterministic simulation of Turing machine computations below logspace, Math. Systems Theory, 18 (1985), pp. 11-18.
18. P. MICHEL, A survey of space complexity, Theoret. Comput. Sci., 101 (1992), pp. 99-132.
19. D. RANJAN, R. CHANG, AND J. HARTMANIS, Space bounded computations: Review and new separation results, Theoret. Comput. Sci., 80 (1991), pp. 289-302.
20. M. SIPSER, Halting space-bounded computations, Theoret. Comput. Sci., 10 (1980), pp. 335-338.
21. R. E. STEARNS, A regularity test for pushdown-machines, Inform. and Control, 11 (1967), pp. 323-340.
22. R. E. STEARNS, J. HARTMANIS, AND P. M. LEWIS, Hierarchies of memory limited computations, in Proc. 1965 IEEE Conference Record on Switching Circuit Theory and Logical Design, IEEE Press, Piscataway, NJ, 1965, pp. 179-190.
23. R. SZELÉPCSENYI, The method of forced enumeration for nondeterministic automata, Acta Inform., 26 (1988), pp. 279-284.
24. A. SZEPIETOWSKI, Turing Machines with Sublogarithmic Space, Lecture Notes on Comput. Sci. 843, Springer-Verlag, Berlin, New York, Heidelberg, 1994.
25. K. WAGNER, The alternation hierarchy for sublogarithmic space: An exciting race to STACS '93 (editiorial note), in Proc. 10th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci., Springer-Verlag, Berlin, 1993, pp. 2-4.
26. K. WAGNER AND G. WECHSUNG, Computational Complexity, Reidel, Dordrech, 1986.