subset construction:

Given the following NFA N over the alphabet Σ = {a, b, c}, construct a DFA D(N) that accepts the same language as N by applying the subset construction:

To save work, consider only the reachable part of D(N). Clearly show your calculations in a state-transition table. Then draw the transition diagram for the resulting DFA D(N). Do not forget to indicate the initial state and the final states both in the transition table and the final transition diagram.


Feel free to contact the admin for any suggestions and help.