CS4820 Spring 2013 Notes on Turing Machines 19/26
(e) ever moves its head more than 481 tape cells away from the left endmarker on input
ε ?
(f) accepts the null string ε ?
(g) accepts any string at all?(h) accepts every string?(i) accepts a finite set?(j) accepts a recursive set?
(k) is equivalent to a Turing machine with a shorter description???