Sublogarithmic Bounds on Space and Reversals

SIAM Journal on Computing

Volumn 28, Issue 1, 1998, Pages 325-340

  Geffert, Viliam ^a   Mereghetti, Carlo ^b   Pighizzini, Giovanni ^b  

^a P J AFÁRIK UNIVERSITY   (Slovakia)

^b UNIVERSITY OF MILAN   (Italy)

Author keywords

Alternation; Computational complexity; Computational lower bounds; Formal languages

Indexed keywords

COMPUTATIONAL COMPLEXITY; FORMAL LANGUAGES; FUNCTIONS;

COMPUTATIONAL LOWER BOUNDS;

TURING MACHINES;

EID: 0032057852     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539796301306     Document Type: Article

References (24)

1. M. ALBERTS, Space complexity of alternating Turing machines, in Fundamentals of Computation Theory, Proceedings, Lecture Notes in Computer Science 199, Springer-Verlag, Berlin, New York, 1985, pp. 1-7.
2. B. VON BRAUNMÜHL. R. GENGLER, AND R. RETTINGER. The alternation hierarchy for machines with sublogarithmic space is infinite, in Symposium on Theoretical Aspects of Computer Science 1994, Proceedings, Lecture Notes in Computer Science 775, Springer-Verlag, Berlin, New York, 1994, pp. 85-96.
3. A. BERTONI, C. MEREGHETTI, AND G. PIGHIZZINI, An optimal lower bound for nonregular languages, Inform. Process. Lett., 50 (1994), pp. 289-292; Corrigendum, 52 (1994), p. 339.
4. A. BERTONI, C. MEREGHETTI, AND G. PIGHIZZINI, An optimal lower bound for nonregular languages, Inform. Process. Lett., 50 (1994), pp. 289-292; Corrigendum, 52 (1994), p. 339.
5. A. BERTONI, C. MEREGHETTI, AND G. PIGHIZZINI, Strong optimal lower bounds for Turing machines that accept nonregular languages, in Mathematical Foundations of Computer Science 1995, Proceedings, Lecture Notes in Computer Science 969, Springer-Verlag, Berlin, New York, 1995, pp. 309-318.
6. A. CHANDRA, D. KOZEN, AND L. STOCKMEYER, Alternation, J. Assoc. Comput. Mach., 28 (1981), pp. 114-133.
7. V. GEFFERT, A hierarchy that does not collapse: Alternations in low level space, RAIRO Inform. Théor. Appl., 28 (1994), pp. 465-512.
8. V. GEFFERT, Bridging across the log(n) space frontier, in Mathematical Foundations of Computer Science 1995, Proceedings, Lecture Notes in Computer Science 969, Springer-Verlag, Berlin, New York, 1995, pp. 50-65.
9. G. HARDY AND E. WRIGHT. An Introduction to the Theory of Numbers, 5th ed., Oxford University Press, 1979.
10. J.-W. HONG, A tradeoff theorem for space and reversal, Theoret. Comput. Sci., 32 (1984), pp. 221-224.
11. J. HOPCROFT AND J. ULLMAN, Some results on tape-bounded Turing machines, J. Assoc. Comput. Mach., 16 (1969), pp. 168-177.
12. J. HROMKOVIČ, B. ROVAN, AND A. SLOBODOVÁ, Deterministic versus nondeterministic space in terms of synchronized alternating machines, Theoret. Comput. Sci., 132 (1994), pp. 319-336.
13. N. IMMERMAN, Nondeterministic space is closed under complement, SIAM J. Comput., 17 (1988), pp. 935-938.
14. K. IWAMA, ASPACE(o(log log n)) is regular, SIAM J. Comput., 22 (1993), pp. 136-146.
15. P. LEWIS, R. STEARNS, AND J. HARTMANIS, Memory bounds for the recognition of context free and context sensitive languages, in IEEE Conference Record on Switching Circuit Theory and Logical Design, 1965, pp. 191-202.
16. M. LIŚKIEWICZ AND R. REISCHUK, The sublogarithmic alternating space world, SIAM J. Comput., 25 (1996), pp. 828-861.
17. C. MEREGHETTI AND G. PIGHIZZINI, A remark on middle space bounded alternating Turing machines, Inform. Process. Lett., 56 (1995), pp. 229-232.
18. W. SAVITCH, Relationships between nondeterministic and deterministic tape complexities, J. Comput. System Sci., 4 (1970), pp. 177-192.
19. A. SLOBODOVÁ, On the power of one-way globally deterministic synchronized alternating Turing machines and multihead automata, Internat. J. Found. Comput. Sci., 6 (1995), pp. 431-446.
20. R. STEARNS, J. HARTMANIS, AND P. LEWIS, Hierarchies of memory limited computations, in IEEE Conference Record on Switching Circuit Theory and Logical Design, 1965, pp. 179-190.
21. I. SUDBOROUGH, Efficient algorithms for path system problems and applications to alternating and time-space complexity classes, in 21st IEEE Symposium on Foundations of Computer Science, Proceedings, 1980, pp. 62-73.
22. R. SZELEPCSÉNYI, The method of forced enumeration for nondeterministic automata, Acta Inform., 26 (1988), pp. 279-284.
23. A. SZEPIETOWSKI, Remarks on languages acceptable in log log n space, Inform. Process. Lett., 27 (1988), pp. 201-203.
24. A. SZEPIETOWSKI, Turing Machines with Sublogarithmic Space, Lecture Notes in Computer Science 843, Springer-Verlag, Berlin, New York, 1994.