dfa minimization

Step $1$: Remove unreachable states.

Step $2$: Mark the distinguishable pairs of states.

To achieve this task, we first mark all pairs p$,$ q$,$ where p$$F and q$$F as distinguishable. Then, we proceed as follows:

repeat

for all non$-$marked pairs p$,$ q do

for each letter a do

if the pair $($p$,$ a$),($q$,$ a$)$ is marked

then mark p$,$ q

until no new pairs are marked

Step $3$: Construct the reduced automaton A$.$

implement dfa minimization with python from scratch with no other library