Efficient regular grammatical inference techniques by the use of partial similarities and their logical relationships

Abstract New techniques for regular grammatical inference are proposed by the use of partial similarities among sample sentences and their logical relationships. These have an advantage to make clear the characteristic features of resultant automata to be inferred. The inference techniques including previous ones are classified from the point of views of the fidelity to samples and the efficiency of inference. It is also shown from examples that the proposed methods can be efficient according to these two criteria.

[1]  Marc Richetin,et al.  Efficient regular grammatical inference for pattern recognition , 1984, Pattern Recognit..

[2]  King-Sun Fu,et al.  Syntactic Pattern Recognition And Applications , 1968 .

[3]  Taylor L. Booth,et al.  Grammatical Inference: Introduction and Survey - Part I , 1975, IEEE Trans. Syst. Man Cybern..

[4]  Jerome A. Feldman,et al.  On the Synthesis of Finite-State Machines from Samples of Their Behavior , 1972, IEEE Transactions on Computers.

[5]  Laurent Miclet Regular Inference with a Tail-Clustering Method , 1980, IEEE Transactions on Systems, Man, and Cybernetics.

[6]  Taylor L. Booth,et al.  Grammatical Inference: Introduction and Survey-Part I , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.