8 votes 8 votes Identify the regular expression which represents the language containing all strings of $a's$ and $b's$ where each string contains at least two $b's$ $(a+b)^*ba^*b$ $(a+b)^*ba^*ba$ $(a+b)^*ba^*b(a+b)^*$ None of these Theory of Computation theory-of-computation regular-expression gateforum-test-series + – amitlko asked Oct 1, 2016 edited Aug 7, 2021 by soujanyareddy13 amitlko 2.1k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 5 votes 5 votes ans is C Regular expression which represents the language containing all strings of a's and b's where each string contains at least two b's is (a+b)* b a* b (a+b)* option A does not accept bba option B does not accept bbb option C accept all Shubham Pandey 2 answered Oct 1, 2016 selected Oct 1, 2016 by amitlko Shubham Pandey 2 comment Share Follow See 1 comment See all 1 1 comment reply amitlko commented Oct 1, 2016 reply Follow Share Thanks 0 votes 0 votes Please log in or register to add a comment.
4 votes 4 votes A we cannot end with a B we cannot end with b C we can start with a or b and have 2 b's at least and can end with a or b Hence option c is correct owais2580 answered Oct 9, 2016 owais2580 comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes C is the answer A is not because 'ababa' fails B is not because 'abb' fails rahulsangwan59 answered Oct 9, 2016 rahulsangwan59 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Answer is c because it is represent acceptance of atleast 2 b sharmishtha paliwal answered Oct 7, 2016 sharmishtha paliwal comment Share Follow See 1 comment See all 1 1 comment reply set2018 commented Oct 26, 2017 reply Follow Share (a+b)* b (a+b)* b (a+b)* answer should be D 0 votes 0 votes Please log in or register to add a comment.