0 0 votes As per the given solution,B should be the correct answer right why is D given as the correct answer as the machine accepts atleast one b. Theory of Computation theory-of-computation turing-machine recursive-and-recursively-enumerable-languages regular-expression + – sripo 838 views answer comment Share Follow Print See all 2 Comments 2 2 Comments reply register_user_19 commented Jan 5, 2019 reply Follow flag how you say option B) ??? IN b: {a} is not their, but TM accept {a} so option d) is correct. solution given is correct. TM accept RL (aa* + bb*) 0 0 replyShare BASANT KUMAR commented Aug 10, 2019 reply Follow flag i think all option is incorrect because the condition for "n" will be >=1 for both a and b which is not present in any option. 0 0 replyShare Please log in or register to add a comment.
