A genetic algorithm for regular inference

Document Type

Conference Proceeding

Faculty

Faculty of Computing, Health and Science

School

School of Computer and Information Science

RAS ID

1745

Comments

Hingston, P. (2001, July). A genetic algorithm for regular inference. In Proceedings of the 3rd Annual Conference on Genetic and Evolutionary Computation (pp. 1299-1306). Morgan Kaufmann Publishers Inc..

Abstract

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.

This document is currently not available here.

Share

 
COinS