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 It looks something like.. b(bb)* + (a + b(bb)*a + b(bb*)ba).(b + abba + aa)* I maybe wrong, if so please tell me. lU$er answered Apr 15, 2017 lU$er comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes (bb+ab*a)* ((a+ba)b* + b) Is this right? sriharshavk answered May 16, 2017 sriharshavk comment Share Follow See 1 comment See all 1 1 comment reply Shubhanshu commented Jul 3, 2017 reply Follow Share Yes it is.. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes The language for this finite automata would be the regular expression for all final states. Rupendra Choudhary answered May 24, 2017 Rupendra Choudhary comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Ans) (b(bb)*a+a)((aa)*+b)*+b(bb)* Please verify. Shivam Bhardwaj answered Jun 4, 2017 Shivam Bhardwaj comment Share Follow See all 0 reply Please log in or register to add a comment.