☰
GkSeries.com
✕

The language of all words (made up of a’s and b’s) with at least two a’s can be described by the regular expression

[A] b*ab*a(a+b)*
[B] (a+b)*ab*a(a+b)*
[C] (a+b)*a(a+b)*a(a+b)*
[D] all of the above
Answer & Explanation
Option: [D]

⭐ Make GKSeries Your Preferred Source on Google

Add GKSeries as Preferred Source
Click Here to Read more questions