-
Let L = {W ∈ (0, 1) * | W has even number of 1s}, i.e., L is the set of all bit strings with even number of 1's. Which one of the regular expressions below represents L?
-
- (0* 10* 1)*
- 0 * (10* 10*)*
- 0 * (10 *1)* 0*
- 0 * 1(10 * 1) * 10 *
- (0* 10* 1)*
Correct Option: B
It is given that L is the set of all bit strings with even number of 1's so the regular expression should exhibit the same. Now, the min string should be e and the string should be e, 0, 11, 101,... The string obtained from such expression is 0* (10* 10 *)*
