T. Jiang and B. Ravikumar, “Minimal NFA Problems Are Hard,” SIAM Journal on Computing, Vol. 22, No. 6, 1993, pp. 1117-1141. Hdoi:10.1137/0222067
has been cited by the following article:
TITLE: Local Search Heuristics for NFA State Minimization Problem
AUTHORS: Andrey V. Tsyganov
KEYWORDS: Nondeterministic Finite Automata; State Minimization; Heuristics; Local Search; Parallelism
JOURNAL NAME: International Journal of Communications, Network and System Sciences, Vol.5 No.9A, September 18, 2012
ABSTRACT: 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.