3.4.1. DFA exercises¶

HINT: If DFA \(M\) accepts language \(L\), the we can create a machine to accept the complement of \(L\) by reversing the final and non-final states of \(M\). However, that only works on a complete DFA, meaning that we have to take into account the trap state.