Academic Journals Database
Disseminating quality controlled scientific knowledge

Local Search Heuristics for NFA State Minimization Problem

ADD TO MY LIST
 
Author(s): Andrey V. Tsyganov

Journal: International Journal of Communications, Network and System Sciences
ISSN 1913-3715

Volume: 05;
Issue: 09;
Start page: 638;
Date: 2012;
Original page

Keywords: Nondeterministic Finite Automata | State Minimization | Heuristics | Local Search | Parallelism

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.
Affiliate Program     

Tango Jona
Tangokurs Rapperswil-Jona