Generation of Finite Automaton by Genetic Algorithms
Tomoyuki Yokoi, Toshihiko Ono · IEEJ Transactions on Electronics Information and Systems · 2001
This study uses genetic algorithms (GAs) for the system which generates a finite automaton automatically. This system can build an automaton by incorporating automaton construction algorithms (ACAs) into the GAs. ACAs are algorithms that construct a finite automaton on the basis of gene information. The per-formance of this system is realized by integration algorithms and minimization algorithms. The integration algorithms are applied when an automaton is made by combining several automata, each of which is created by divided requirements of the original automaton. The minimization algorithms are used to minimize the number of nodes of the automaton which GAs and the integration algorithms generate. The most suitable finite automaton is formed automatically by using these algorithms collectively. An automaton drawing pro-gram can show the finite automaton as a state transition diagram to confirm the result easily. By simulations, the effectiveness of this method was confirmed.