0 votes 0 votes Can we simplify this RegEx - $a^*ba^*b(a+b)^*$ Theory of Computation regular-expression theory-of-computation + – iarnav asked Aug 31, 2017 iarnav 592 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Arnab Bhadra commented Aug 31, 2017 reply Follow Share The language is all String contains at least two b's. I do not thing you can simplify further. 2 votes 2 votes hs_yadav commented Aug 31, 2017 reply Follow Share DFA obtained from this RE...is having minimum state.... i think it can't be simplified further.....?????? 1 votes 1 votes iarnav commented Aug 31, 2017 reply Follow Share Thank you all. You've been so kind. :) 0 votes 0 votes Please log in or register to add a comment.
Best answer 1 votes 1 votes Minimum string accepted by this REX will be 'bb'. To accept string of length we need at least 3 states as you can see below Hence the DFA can't be minimised further. Given REX is minimal Satyajeet Singh answered Aug 31, 2017 • selected Aug 31, 2017 by iarnav Satyajeet Singh comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Language generated by this re contains atleast 2 b's sandeepjkh answered Aug 31, 2017 sandeepjkh comment Share Follow See all 0 reply Please log in or register to add a comment.