3 votes 3 votes What is the answer for following question. Theory of Computation made-easy-test-series theory-of-computation finite-automata + – Durgesh Singh asked Jun 23, 2017 edited Mar 5, 2019 by adeebafatima1 Durgesh Singh 977 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply rahul sharma 5 commented Jun 23, 2017 reply Follow Share Question is not visible 0 votes 0 votes nikkey123 commented Sep 23, 2017 reply Follow Share @ Durgesh Singh please tell us the correct answer i think option c is correct one 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes answer will be (a + b)^(*) a all the strings will be combination of either a or b and ending with a Kaluti answered Jun 25, 2017 Kaluti comment Share Follow See all 3 Comments See all 3 3 Comments reply Durgesh Singh commented Jun 26, 2017 reply Follow Share The answer is a*b*a*a as mentioned by @Saswat Swarup. Please justify your answer. 0 votes 0 votes Shubhanshu commented Jul 2, 2017 reply Follow Share Consider the string "ababababababa" which is from (a+b)*a but not accepted by given automata. Hence, Answer is a*b*a*a. 0 votes 0 votes rohan mishra commented Jul 27, 2017 reply Follow Share 1. (a*b*c* + a) should be the answer. please correct me where I am wrong. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes ans should be only C a*b*a*a rajoramanoj answered Sep 23, 2017 rajoramanoj comment Share Follow See all 0 reply Please log in or register to add a comment.