3 votes 3 votes Consider the given below Turing Machine and identify the correct language accepted: (a+b)*aa(a+b)* b*a(bb*a)*a b*ab*a None of these The answer is given as (1). But I think (3) is correct as well. Can anyone tell me why only (1) is correct. Theory of Computation theory-of-computation turing-machine test-series + – Anurag Aizen Mukherj asked Jan 20, 2019 Anurag Aizen Mukherj 1.0k views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply prashant jha 1 commented Jan 20, 2019 reply Follow Share "aba" belongs to language represented by reg ex 3. Is it accepted by the turing machine? 0 votes 0 votes aditya333 commented Jan 20, 2019 reply Follow Share the language is set of all strings having two consecutive a's. so option a is correct . for option c you can clearly se it has strings like "baba" which isn't accepted by the turing machine 1 votes 1 votes SUNNY054 commented Jan 21, 2019 reply Follow Share aba will reach to q2 not q3 0 votes 0 votes Shivateja MST commented Jul 7, 2019 reply Follow Share Option 2 cannot accept b*a(bbb......a) Similarly Option 3 cannot accept abaa But option 1 is generating abaaab which cannot be accepted. So option D is correct i think 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes consecutive a is the acceptance condition SUNNY054 answered Jan 21, 2019 SUNNY054 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes According to me only option B should be correct. A is not correct Option C doesn’t accept string ”aba” rish1602 answered Sep 10, 2021 rish1602 comment Share Follow See all 0 reply Please log in or register to add a comment.