Write an algorithm for minimizing number of states.

Method for finding the minimum DFA –
Begin
(i) for P in F and q in Q-F do mark (p, q);
(ii) for each pair of distinct states (p, q) in F ×F or (Q – F) ×(Q - F) do
(iii) if for some input symbol a(δ(p,a),δ(q,a)) is marked then
begin
(iv) mark (p, q);
(v) recursively mark all unmarked pairs on the list for (p, q) and on the lists of other pairs that are marked at this step
end
else /* no pair  (δ(p,a),δ(q,a)) is marked */
(vi) for all input symbols a do
(vii) put (P, Q) on the list for (δ(p,a),δ(q,a)) unless δ(p,a)= δ(q,a)
end.