A genetic algorithm for regular inference
Philip Hingston · Research Online (Edith Cowan University) · 2001
We show how a genetic algorithm can be used for the inference of a regular language from a set of positive (and optionally also negative) examples. The genetic algorithm attempts to find the simplest description of the example data in terms of a finite state automaton model.