DFA Minimizing State Machines Using Hash- Tables

In algorithm design DFA minimization is an important problem.DFA minimization is based upon DFA equivalence. Two DFA's can be called as equivalent DFA's if and only if they accept the same strings of same set. Various algorithms are used to implement the minimized DFA. The performance of these algorithms is verified using a set of data which is generated artificially. Results presents a number of cases where the new Hash table based algorithms perform better than the traditional TD algorithm and there is also a comparative analysis of performance between DFA using array and DFA using Hash Tables.