$($epsilion$)$nfa to dfa convert

implement $($epsilion$)$nfa to dfa convert with python from scratch with no other library simple function and no ambugity like photo witch i send it and try the example in the photo to test programm.

step

Initial state of NFA: $q_0$

Initial state of DFA: $\{q_0\}$

step

For every DFA's state $\{q_i,q_j,$dots,$q_m\}$

compute in the NFA

add transition to DFA

$(\{q_i,q_j,$dots,$q_m\},a)=\{q_k^{\text{'}},q_i^{\text{'}},$dots,$q_n^{\text{'}}\}$

step

For any DFA state $\{q_i,q_j,$dots,$q_m\}$

if some $q_j$ is accepting state in NFA

step $3.$

Repeat Step $2$ for every state in DFA and

symbols in alphabet until no more states

can be added in the DFA

Then, $\{q_i,q_j,$dots,$q_m\}$

is accepting state in DFA

NFA::::

CONVERTED NFA TO DFA:::