edited by
2,075 views

5 Answers

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
selected by
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

Related questions

0 votes
0 votes
0 answers
1
0 votes
0 votes
0 answers
2
0 votes
0 votes
0 answers
3
1 votes
1 votes
1 answer
4