Theoretical Computer Science
Journal of the ACM (JACM)
Turing Machines with Sublogarithmic Space
Turing Machines with Sublogarithmic Space
Some properties of one-pebble turing machines with sublogarithmic space
Theoretical Computer Science
Automata on a 2-dimensional tape
FOCS '67 Proceedings of the 8th Annual Symposium on Switching and Automata Theory (SWAT 1967)
Hi-index | 0.89 |
Inoue et al. [A. Inoue, A. Ito, K. Inoue, T. Okazaki, Some properties of one-pebble Turing machines with sublogarithmic space, Theoret. Comput. Sci. 341 (2005) 138-149] conjectured that the language {ww|w@?{a,b}^+} is not accepted by any alternating one-pebble Turing machine with sublogarithmic space. In this paper we disprove the conjecture by showing that there exists an alternating one-pebble Turing machine accepting the language in loglogn space.