Abstract

We recall briefly in this paper the formal theory of regular grammatical inference from positive and negative samples of the language to be learned. We state this problem as a search toward an optimal element in a boolean lattice built from the positive information. We explain how a genetic search technique may be applied 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-incremental procedure. Finally, an experimental protocol to assess the performance of a regular inference technique is detailed and comparative results are given. 1 Introduction Grammatical Inference is an instance of the Inductive Learning problem which can be formulated as the task of discovering common structures in examples which are supposed to be generated by the same process. In this particular case, the examples are sentences defined on a specific alphabet and the common structures are represented by a gram...

Citations

6071	Genetic Algorithms - Goldberg - 1989
1639	Genetic algorithms + Data Structures = Evolution Programs - Michalewicz - 1989
793	Language identification in the limit - Gold - 1967
294	Introduction to Formal Language Theory - Harrison - 1978
195	Complexity of automaton identification from given data - Gold - 1978
179	The Theory of Parsing - Aho, Ullman - 1972
144	Inference of reversible languages - Angluin - 1982
96	Inferring Regular Languages in Polynomial Update Time - Oncina, Garcia - 1992
75	Finite Automata, Behavior and Synthesis - Trakhtenbrot, Barzdin - 1973
53	Solving Partitioning Problems With genetic Algorithms - Jones, Beltramo - 1991
41	What is the search space of the regular inference - Dupont, Miclet, et al. - 1994
36	Grammatical inference: Introduction and survey - Fu, Booth - 1975
19	Context free grammar induction using genetic algorithms - Wyard - 1991
6	Regular Inference with a Tail-Clustering Method - Miclet - 1980
6	Inf'erence grammaticale `a partir d'exemples et de contre-exemples : deux algorithmes optimaux : (big et rig) et une version heuristique (brig). JAVA94, Journ'ees Acquisition, Validation, Apprentissage F1--F13 - Miclet, Gentille - 1994
4	Inf'erence de Grammaires R'eguli`eres. -- Th`ese de PhD, Ecole Nationale Sup'erieure des T'el'ecommunications - Miclet - 1979
3	Dynamic Construction of Finite-Automata From Examples Using HillClimbing - Tomita - 1982