Which of the following regular expressions denotes a language comprising all possible strings of even length over the alphabet ( 0 , 1 ) ?
| A. | (0 | 1) * |
| B. | (0 | 1) (0 | 1)* |
| C. | (00 01 10 11 )* |
| D. | (0 | 1 ) (0 | 1)(0 | 1 ) * |
Answer : C Explanation : |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
