0 votes 0 votes ( All strings of even length over {a,b} Complement of (a+b)* (a+b)* All strings of odd length over {a,b} Theory of Computation turing-machine theory-of-computation + – Parshu gate asked Nov 27, 2017 Parshu gate 335 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Ashwin Kulkarni commented Nov 27, 2017 reply Follow Share there is no way to reach q2. Then how we can reach qf ? Answer should be B. complement of (a+b)* is empty language. 2 votes 2 votes Parshu gate commented Nov 27, 2017 reply Follow Share Can u please show it with the state diagram 0 votes 0 votes Namit Dhupar commented Nov 27, 2017 reply Follow Share You don't really need a state Diagram to figure that out... You see, there is no movement of R/W head from State q1 to q2 whatsoever), but in the question, they took q2 as it is and passed BLANK to final state qf , hence! obviously, there's no a' and b's to be seen in the machine's o/p whatsoever. Look below, Ashwin has already posted the state diag. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes there is no way to reach q2. Then no way to reach qf . Hence nothing is accepted by this TM Answer should be B. complement of (a+b)* is empty language. Ashwin Kulkarni answered Nov 27, 2017 Ashwin Kulkarni comment Share Follow See all 0 reply Please log in or register to add a comment.