I am supposed to minimize the following DFA automa, which contains dead state:


But after the minimization of the automata, it stayed the same.

Is it correct?


I didn't try to minimize your particular automaton but it is definitely possible for a minimal DFA to have a dead state. Keep in mind that often such states are omitted from the graphical representation of the automaton (nevertheless they are still part of the set of states of the DFA).

Think, for example, of a minimal DFA that recognizes $L=\{a\}$ over the alphabet $\Sigma = \{a, b\}$.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.