Q3.Convert following regular expression to NFA using systematic way, discussed in class. i. (0 | 10)*11 ((1 | 01) | 00(0 | 10)*11) ii. (0 | 10)*111*0 (11*0 | 0(0 | 10)*111*0)* iii. (0 | 10)*11(( 1 | 01 | 00(0 | 10)*11)* | 1*0 (11*0 | 0(0 | 10)*111*0 )*) Q4 You are required to convert NFAs (in question 3) to DFA using subset construction algorithm. Noted: Question no 4

Answe Answer 2 Answer 3 DFA NFA STATE STATE TYPE 0 (0,1,4) B C (5) B D (2) (61 moo (3,8,9.11) G H (7.8.9.11) G H (9.10.11) H (12 (13,14,15,16.18,21,38,40) 1 K L (39,41,42,44,75) accept N P (19,22) (15,16,17,18,21,37,38) L 145 (42.43,44) O Z 3 (23,24,27) (15,16,18,20.21,37.38) P L (39.75) O accep (46,47.48.54.74,75) R accept U V (28) S (25) (551 U (49,50.52) Z AA AR x < < 129 (26.31,32.34) AC AL (56,57,60) AF (47.48,53.54,73,74,75) Z accept U V (50.51,52) AA AA (30,31,32.34) AB AC AD (32,33,34) AC AD AD AG (35) (58) AE AH 161) AF (15,16,18,21,36,37.38) AG Q K L (59,63,64,66) AH AJ AK (62,63.64,66) 2 AJ AK (64,65,66} AJ AL AK (67 AK AL (68,69.71) AL AM AN (47,48,54,72,73,74,75) AM accept U V (69,70.71) AN AM AN