Search code examples
computer-sciencefinite-automataturing-machinescomputation-theory

Minimizing Finite State Automaton


I am trying to minimize this DFA: http://img145.imageshack.us/img145/3006/dfac.png

Here's my minimized DFA: http://img195.imageshack.us/img195/4131/mdfa.png

Am I correct? Thanks

P.S.-This is homework. We are allowed to discuss the homework. I am not asking for the answer, I just want to know if I am on the right track or not as this is my first time dealing with state machines.


Solution

  • No your proposed solution is not correct; you see the dfa you have constructed can accept the (otherwise non-acceptable) string "aac", that means you can't join states (11,15,17) and (15,17).

    Looking at the original DFA I cannot think of any solution with less than 6 states; but yet again that means nothing ;).