We recall briefly in this paper the formal theory of regular grammatical inferen ce from positive and negative samples of the language to be learned. We state th is problem as a search toward an optimal element in a lattice built from the positive information. We explain how a genetic search technique may be appl ied to this problem and we introduce a new set of genetic operators. In view of limiting the increasing complexity as the sample size grows, we propose a semi-i ncremental procedure. Finally, an experimental protocol to assess the performanc e of a regular inference technique is detailed and comparative results are given .
Dupont, P. (1994). Regular Grammatical Inference from Positive and Negatives Samples by Genetic Search : the GIG method. In R. Carrasco, J. Oncina (ed.), Grammatical Inference and Applications, Alicante, Spain, September 21-23, 1994 (p. p. 236--245). Springer-Verlag. https://hdl.handle.net/2078.5/253766