0 votes 0 votes Prove or disprove the following conjecture. If $M = (Q,Σ,δ,q_0,F)$ is a minimal dfa for a regular language $L$, then $\widehat{M}= (Q, Σ,δ,q_0,Q – F)$ is a minimal dfa for $\overline{L}$. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation finite-automata + – Naveen Kumar 3 asked Mar 30, 2019 Naveen Kumar 3 209 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.