MadeEasy WorkBook: Theory of Computation - Regular Expression

Question

Given answer is option c. Can anyone tell me how? 

Comments

And next time when someone else asks the same questions they will also not find since you've uploaded image instead of typing the question . I too used to do the same but it's better for the community if you can type questions

---

OK @shaz

---

@Jyoti Kumari97

https://gateoverflow.in/blog/5823/screenshot

Answer 1

C is the right answer.

 The  language L=(a+$\epsilon$)(bb*a)* can not produce b, bb

option a)  It says language L must contain all strings that does not have aa as substring so string b should be in L.

option b) It says no two consecutive a's again failed due to above string.

option c) This is is correct because L contains all strings that does not end with b and does not contain two or more consecutive a's.

Answer 2

You can try generating the strings first and see the pattern and eliminate the options.

The regular expression has the language L = { ε , a,ba,bba, aba, abba...}

You can see that we can't get the string "abab" using this, this alone eliminates options A and B.

And thus by generating more strings you can see that the correct option is indeed C.