The language of all words with at least 2 a's can be described by the regular expression
| A. | (ab)*a and a (ba)* |
| B. | (a + b)* ab* a (a + b)* |
| C. | b* ab* a (a + b)* |
| D. | all of these |
Answer : D Explanation : |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
