A New NFA Reduction Algorithm for State Minimization Problem

The problem of creating a minimal NFA is a primal (fundamental) problem. Reducing the size of NFA by using NFA Reduction Algorithm has been shown to reduce importantly the search time. This paper innovate a new NFA reduction algorithm for the state minimization of NFA. The analysis of the proposed algorithm is given and also demonstrates the results of the numerical experiments. This paper conceives the problem of reducing the number of state and transition of Non Deterministic Finite Automata. Numerical experiments show that NFA reduction algorithm produces a minimal automation in all most condition. NFA reduction algorithm also resolves the complexity of KamedaWeiner algorithm. This paper shown empirically that these algorithm are effective in largely reducing the memory requirement of NFA minimization algorithm.