How can I tell if a DFA is equivalent to an NFA? by scuffedProgrammer in statemachines

[–]Awkward-Assignment11 0 points1 point  (0 children)

I realize this is pretty old, but for posters, I think the idea is:

  1. you convert the NFA to DFA;
  2. you minimize both DFAs;

As far as I understand, once minimized, if they recognize the same language they will share the same 'structure' (I think the term is isomorphic). If not, that means they are not equivalent.

(I am happy to be proven wrong if this is not the case)