Inference Methods For Tree Automata From Sample Set Of Trees

A method for inferring of a frontier-to-root tree automata from a finite sample set of trees is presented. The method uses the concept of a k-tail of a tree with respect to a sample set of trees, which Is defined in this paper. The properties of an inferred tree automaton and some modification of the method are also presented.

[1]  A. Nerode,et al.  Linear automaton transformations , 1958 .

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

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

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

[5]  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.