Which of the following regular expressions denotes a language comprising all possible strings over the alphabet {a, b } ?
| A. | a* b* |
| B. | (a | b)* |
| C. | (ab)+ |
| D. | (a | b*) |
Answer : B Explanation : |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
