How Considering Incompatible State Mergings May Reduce the DFA Induction Search Tree

A simple and effective method for DFA induction from positive and negative samples is the state merging method. The corresponding search space may be tree-structured, considering two subspaces for a given pair of states: the subspace where states are merged and the subspace where states remain different. Choosing different pairs leads to different sizes of space, due to state mergings dependencies. Thus, ordering the successive choices of these pairs is an important issue. Starting from a constraint characterization of incompatible state mergings, we show that this characterization allows to achieve better choices, i.e. to reduce the size of the search tree. Within this framework, we address the issue of learning the set of all minimal compatible DFA's. We propose a pruning criterion and experiment with several ordering criteria. The prefix order and a new entropy based criterion have exhibit the best results in our test sets.

[1]  Vasant G Honavar,et al.  Efficient Learning of Regular Languages Using Teacher-Supplied Positive Samples and Learner-Generated Queries , 1993 .

[2]  李幼升,et al.  Ph , 1989 .

[3]  Dov Dori,et al.  Shape, Structure and Pattern Recognition , 1995 .

[4]  John W. Carr,et al.  A Solution of the Syntactical Induction-Inference Problem for Regular Languages , 1978, Comput. Lang..

[5]  Pierre Dupont.  Utilisation et apprentissage de modeles de langage pour la reconnaissance de la parole continue , 1996 .

[6]  Tom M. Mitchell,et al.  Generalization as Search , 2002 .

[7]  Kevin J. Lang.  Random DFA's can be approximately learned from sparse uniform examples , 1992, COLT '92.

[8]  Enrique Vidal,et al.  Identification of DFA: data-dependent vs data-independent algorithms , 1996, ICGI.

[9]  A.,et al.  INCREMENTAL GRAMMATICAL INFERENCE FROM POSITIVE ANDNEGATIVE DATA USING UNBIASED FINITE STATE AUTOMATA , 1994 .

[10]  Haym Hirsh.  Polynomial-Time Learning with Version Spaces , 1992, AAAI.

[11]  J. Oncina,et al.  INFERRING REGULAR LANGUAGES IN POLYNOMIAL UPDATED TIME , 1992 .

[12]  DANA ANGLUIN,et al.  On the Complexity of Minimum Inference of Regular Sets , 1978, Inf. Control..

[13]  Enrique Vidal,et al.  What Is the Search Space of the Regular Inference? , 1994, ICGI.

[14]  Pierre Dupont,et al.  Regular Grammatical Inference from Positive and Negative Samples by Genetic Search: the GIG Method , 1994, ICGI.

[15]  Barak A. Pearlmutter,et al.  Results of the Abbadingo One DFA Learning Competition and a New Evidence-Driven State Merging Algorithm , 1998, ICGI.

[16]  Jacques Nicolas.  Regular Inference as a graph coloring problem , 1997 .

[17]  Horst Bunke,et al.  Syntactic and structural pattern recognition : theory and applications , 1990 .