V. Kell, A. Maier, A. Potthoff, W. Thomas and U. Wermuth, “AMORE: A System for Computing Automata, Monoids and Regular Expressions,” Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science on STACS 89, Springer-Verlag, New York, 1989, pp. 537-538.

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.