Inference of tree automata from sample set of trees

A method for inferring of tree automata from sample set of trees is presented. The procedure, which is based on the concept ofk-follower of a tree with respect to the sample tree set, produces a tree automaton capable of accepting all the sample trees as well as other trees similar in structure. The behavior of the inferred tree automaton for varying values of parameterk is also discussed.

[1]  J. Brayer,et al.  A note on the k-tail method of tree grammar inference , 1975 .

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

[3]  Barry Levine.  The Use of Tree Derivatives and a Sample Support Parameter for Inferring Tree Systems , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Janusz A. Brzozowski,et al.  Derivatives of Regular Expressions , 1964, JACM.

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

[6]  Barry Levine,et al.  Derivatives of Tree Sets with Applications to Grammatical Inference , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Taylor L. Booth,et al.  Grammatical Inference: Introduction and Survey - Part II , 1975, IEEE Transactions on Systems, Man, and Cybernetics.

[8]  J. J. Edwards,et al.  An algorithm for the inference of tree grammars , 1976, International Journal of Computer & Information Sciences.

[9]  Walter S. Brainerd,et al.  The Minimalization of Tree Automata , 1968, Inf. Control..