edited by
197 views
0 votes
0 votes
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???
edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
aambazinga asked Sep 8, 2018
421 views
How can we say that any two disjoint co-turing recognisable languages are seperable by some Decidability language?
0 votes
0 votes
0 answers
4
daksirp asked Jul 31, 2018
875 views
Consider <M be the encoding of a Turing Machine as a string over alphabet Σ = {0, 1}. Consider L = {<M>⏐M is TM that halt on all input and L(M) = L′ for some undecid...