Task:

1. Construct DFA for each of the following:

(a) L1 = { binary strings with even number of 1's}

(b) L1 L2 (intersection of L1 and L2)

2. Let L = { binary strings which end with 01}

(a) Construct NFA for L

(b) Convert your NFA to DFA

3. (a) Convert regular expression a(a ab)* b* to NFA

(b) Convert the DFA to regular expression by using (a)

Please solve these problems!

L2 ={binary strings containing at least one 0}