Compilers and Program Languages (Lexical, Syntax..etc..)

For the following NFA transition functions, convert it into a DFSM using the subset method

A B EPSILON
1 {4} { } {2,3}
2 { } {3} { }
3 { } {1 } {4 }
4 { 2} { } {3}
Q0=1 AND F= {4}
USE A SCRATCH PAPER TO COME UP WITH AN ANSWER, IF YOU WANT AND FILL IN THE FOLLOWING:

1. E-CLOSURES FOR EACH STATE
2. INPUT ALPHABETS I = { ? }
3. Q (STATES) = { ? }
4. STARTING STATE = ?
5. ACCEPTING STATES = { ? }
6. TRANSTION FUNCTIONS IN THE FORM OF (Q, I ) -> Q E.G., ([12], A) -> [123]
   or the table (if you want)

3.

IF INPUT ALPHABETS ARE {0, 1}, WRITE A RE WHOSE LANGUAGE IS ALL STRINGS IN WHICH ALL STRINGS CONTAIN

EXACTLY TWO 0’S AND ONE OR MORE 1’S