Reversal complexity revisited
Theor. Comput. Sci., pp. 191-205, 2008.
internal memory spacelower boundm. groheexternal memory dataexternal memory head reversalMore(15+)
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several further tapes on which head reversals remain unrestricted, but size is bounded by s(n) (where n denotes the input length). Recently [M. Grohe, C. Koch, N. Schweikard...More
Full Text (Upload PDF)
PPT (Upload PPT)