1 votes 1 votes Theory of Computation theory-of-computation regular-expression finite-automata + – student2018 asked Apr 15, 2017 student2018 2.1k views answer comment Share Follow See all 10 Comments See all 10 10 Comments reply Show 7 previous comments Ankit Srivastava 7 commented Jul 28, 2017 reply Follow Share @Vishal "ababab" not satisfying in your RE... 0 votes 0 votes joshi_nitish commented Aug 16, 2017 reply Follow Share correct.. 0 votes 0 votes BASANT KUMAR commented Aug 17, 2019 reply Follow Share correct regex will be (a+b.(bb)*a)(b+aa)*. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes >>>> i made a silly mistake....thanks @joshi_nitish (ab*a + bb + bab*a)*(ab* + b + bab*) hs_yadav answered Aug 16, 2017 • edited Aug 16, 2017 by hs_yadav hs_yadav comment Share Follow See 1 comment See all 1 1 comment reply joshi_nitish commented Aug 16, 2017 reply Follow Share @hs_yadav your RE is accepting "aabbbb" which is not in language, also your RE is not accepting "bbbbbab" which is in language, correct RE will be (ab*a + bb + bab*a)*(ab* + b + bab*) 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes CONVERT IT TO DFA AND THEN MINIMIZE ====>> RE= [ab*a + b(ab*a + b)]*[b(ε + ab*) + ab*] tech_beardo answered Aug 12, 2020 • edited Aug 12, 2020 by tech_beardo tech_beardo comment Share Follow See all 0 reply Please log in or register to add a comment.
