1.

Which of the following regular expressions denotes a language comprising all possible strings over the alphabet {a, b } ?

A. (a | *
B. a* b*
C. (a | b*)
D. (a
Answer» B. a* b*


Discussion

No Comment Found