0 votes 0 votes ................................... Theory of Computation theory-of-computation turing-machine + – Tuhin Dutta asked Jan 30, 2018 Tuhin Dutta 1.1k views answer comment Share Follow See all 7 Comments See all 7 7 Comments reply Ashwin Kulkarni commented Jan 30, 2018 reply Follow Share It should be option A. Whenever 1 comes it goes backwards and no chance of reaching blank again. Like 0000 is accepted. But 0001100 is not accepted because after 3 0's it will reach to q1 then after 2 1's it will reach back to q0. then it can't find any 0 on its right and never reach to final state. 0 votes 0 votes Ajay Jadhav commented Jan 30, 2018 reply Follow Share Yes it is accepting 0 also by accepting B from q1 0 votes 0 votes raviyogi commented Jan 30, 2018 reply Follow Share 2nd and 3rd option clear NO , because minimal string accepted by tm is 0, that is not belongs to 2 and 3.Also whenever 01 comes as a substring it goes to infinte loop. so option |A is looking correct. 0 votes 0 votes Tuhin Dutta commented Jan 30, 2018 reply Follow Share yes A) is correct. I felt A) union C) should have been correct. 0 votes 0 votes hs_yadav commented Jan 30, 2018 reply Follow Share tuhin ...for C option it will fall in infinite loop.... 1 votes 1 votes Shubhanshu commented Jan 30, 2018 reply Follow Share @hs_yadav for B) also it will fall into an infinite loop. 0 votes 0 votes hs_yadav commented Jan 30, 2018 reply Follow Share shubham... yes ... (:) i know ... 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes The TM accepts 0100, but none of the languages accept it. So I think option D is the correct answer. AkashChandraGupta answered Oct 31, 2019 AkashChandraGupta comment Share Follow See all 0 reply Please log in or register to add a comment.