0 votes 0 votes Given transition table of TM as follows, 0 1 B q0 qo,1,R, q0,0,R q1,B,R q1 q0,1,R q0,0,R Halt What is the language accepted by above single tape TM where q0 is start State. Tape Alphabet {0,1,B} and input alphabet {0,1}. Theory of Computation theory-of-computation turing-machine + – AnilGoudar asked Sep 18, 2017 AnilGoudar 400 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply joshi_nitish commented Sep 18, 2017 reply Follow Share taking halt as acceptance, above TM is accepting (0+1)+ 0 votes 0 votes A_i_$_h commented Sep 18, 2017 reply Follow Share from q0 its not at all going to q1...whats the use of that state ?? 0 votes 0 votes AnilGoudar commented Sep 18, 2017 reply Follow Share @joshi_nitish , Even empty string can be accepted as there is transition from q0 to q1 to halt on Blank. Correct me if iam wrong. 0 votes 0 votes AnilGoudar commented Sep 18, 2017 reply Follow Share On Blank transition is going from q0 to q1. 0 votes 0 votes Please log in or register to add a comment.
