Method 1: Partitioning Method
1. First, remove unreachable states ie, if you see any state which doesn't have any incoming edge, or which is not reachable from the start state, remove it.
2. Draw state transition table.
3. Find 0 equivalent: 0 equivalent means, separate final state to other states. It means putting all non-final state to the same set and final state/states to another different set.
4.find 1's equivalent, it means from the current state, from a symbol on which set the transition is falling.
if you have to find n equivalent, you need to take help from (n-1) th set.
In minimal DFA we have only 4 states and states are q0q2 , q1,q3, q4