Local Search Heuristics for NFA State Minimization Problem
Andrey Vladimirovich Tsyganov · International Journal of Communications Network and System Sciences · 2012
In the present paper we introduce new heuristic methods for the state minimization of nondeterministic finite automata. These methods are based on the classical Kameda-Weiner algorithm joined with local search heuristics, such as stochastic hill climbing and simulated annealing. The description of the proposed methods is given and the results of the numerical experiments are provided.