CSE 213: Automata

(b) Consider the machine NFA(N). 0.1 1,8 2 3 ii) a,b a E iii) 0,5 iv) ch (9 Construct DFAs that is equivalent to N. v) The formal description of a NFA is ({91,92,93), (0,1), 8, 91, {93}), where d is given by the following table. Draw the state diagram of this machine and convert this NFA to a DFA. 8(9,0) = {91.921 8(9.1) = {9} 8(92,0)= {921 8(92,1)= {} 89,0) = (99) 8(9,, 1) = {q} 4. Use pumping Lemma to prove that the following languages are not Regular a). 09120 Ex: 000111111 b) 0211