An approach to the inference of finite state machines based on a gravitationally-inspired search algorithm; pp. 39–46
Margarita Spichakova · Proceedings of the Estonian Academy of Sciences · 2013
As the inference of a finite state machine from samples of its behaviour is NP-hard, heuristic search algorithms need to be applied. In this article we propose a methodology based on applying a new gravitationally-inspired heuristic search algorithm for the inference of Moore machines. Binary representation of a Moore machine, an evaluation function, and the required parameters of the algorithm are presented. The experimental results show that this method has a lot of potential.