Some Observations Concerning Alternating Turing Machines Using Small Space

Abstract We make some observations concerning alternating Turing machines operating in small space. For example, we show that alternating Turing machines using o(log n) space are more powerful than nondeterministic Turing machines using the same space-bound. In fact, we show that there is a language over a unary alphabet that can be accepted by an on-line alternating Turing machine in log n space, but not by any off-line nondeterministic Turing machine in o(log n) space. We also investigate the weak vs. strong space bounds and on-line vs. off-line machines at these low tape bounds.

[1]  Richard Edwin Stearns,et al.  Hierarchies of memory limited computations , 1965, SWCT.

[2]  Ivan Hal Sudborough,et al.  Efficient algorithms for path system problems and applications to alternating and time-space complexity classes , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[3]  Michael Sipser,et al.  Halting space-bounded computations , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[4]  Juris Hartmanis,et al.  On Tape Bounds for Single Letter Alphabet Language Processing , 1976, Theor. Comput. Sci..

[5]  Kurt Mehlhorn,et al.  Lower Bounds for the Space Complexity of Context-Free Recognition , 1976, International Colloquium on Automata, Languages and Programming.

[6]  Katsushi Inoue,et al.  Alternating On-Line Turing Machines with Only Universal States and Small Space Bounds , 1985, Theor. Comput. Sci..

[7]  Jeffrey D. Ullman,et al.  Some Results on Tape-Bounded Turing Machines , 1969, JACM.

[8]  Maris Alberts.  Space complexity of alternating Turing machines , 1985, FCT.

[9]  Richard E. Ladner,et al.  Space Bounds for Processing Contentless Inputs , 1975, J. Comput. Syst. Sci..

[10]  Kurt Mehlhorn,et al.  A language over a one symbol alphabet requiring only O (log log n) space , 1975, SIGA.

[11]  Stephen A. Cook,et al.  Characterizations of Pushdown Machines in Terms of Time-Bounded Computers , 1971, J. ACM.

[12]  John E. Hopcroft,et al.  Simple Deterministic Languages , 1966, SWAT.