0
$\begingroup$

I have the following question

enter image description here

I have minimized the DFA as the following since the states can only be partitioned to [S0][S1 S2] enter image description here

EDIT: Is my Minimization correct?

$\endgroup$
  • $\begingroup$ Do you have a question? $\endgroup$ – Patrick Stevens Dec 2 '15 at 9:28
  • $\begingroup$ Your minimized DFA is correct; the language in question is the set of non-empty words over the alphabet $\{a,b\}^*$. $\endgroup$ – Brian M. Scott Dec 2 '15 at 9:28
  • $\begingroup$ @PatrickStevens Please see the update. $\endgroup$ – techno Dec 2 '15 at 10:58
  • $\begingroup$ @BrianM.Scott Thanks.The rectangular state indicate the start state i think.Plus i think that the steps required to minimize would be writing the transition table.. then saying that only partition possible is [S0][S1 S2] .Hope thats enough.Its a 15 mark question including the general explanation. $\endgroup$ – techno Dec 2 '15 at 11:01
  • $\begingroup$ @techno: I have to admit that I minimized it by eye. Not knowing exactly what minimization algorithm you’ve been taught, I can’t say how much explanation is really required. The wording suggests that you’re supposed to explain the general procedure for minimizing a DFA, not the details of this particular minimization. $\endgroup$ – Brian M. Scott Dec 2 '15 at 11:13

Your Answer

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

Browse other questions tagged or ask your own question.