1.

The regular expression denote a language comprising all possible strings of even length over the alphabet (0,1) is?(a) 1 + 0(1+0)*(b) (0+1)(1+0)*(c) (1+0)(d) (00+0111+10)*

Answer» Correct choice is (d) (00+0111+10)*

The best I can explain: The condition is satisfied by 00 or 0111 or 10 or iterations of these.


Discussion

No Comment Found

Related InterviewSolutions