DFA minimization runs in O(n^3) time but It could be optimized to O(n^2)

[FormerlyZeroCool]

In Attribute_DFA's minimize DFA method the implementation for DFA minimization uses a linear search when it could use a hashmap to identify indistinguishable states which would bring us to O(n^2) from O(n^3) runtime for DFA minimization.