Question

Give state diagrams of DFAs recognizing the following languages. In all parts, the alphabet is {0,1}.{w| w starts with 0 and has odd length, or starts with 1 and has even length}

Answer 1

The Regular Expression for the language would be :-  (0 + ((0+1)(0+1))* ) + (1 + (0+1) ((0+1)(0+1))*)