This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Derivatives of Tree Sets with Applications to Grammatical Inference
March 1981 (vol. 3 no. 3)
pp. 285-293
Barry Levine, Department of Computer and Information Science, University of Oregon, Eugene, OR 97403.
Tree automata generalize the notion of a finite automaton working on strings to that of a finite automaton operating on trees. Most results for finite automata have been extended to tree automata. In this paper we introduce tree derivatives which extend the concept of Brzozowski's string derivatives. We use tree derivatives for minimizing and characterizing tree automata. Tree derivatives are used as a basis of inference of tree automata from finite samples of trees. Our method compares tree derivative sets and infers a tree automaton based on the amount of overlap between the derivative sets. Several of the limitations present in the tree inference techniques by Brayer and Fu and Edwards, Gonzalez, and Thomason are not imposed by our algorithm.
Citation:
Barry Levine, "Derivatives of Tree Sets with Applications to Grammatical Inference," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 3, no. 3, pp. 285-293, March 1981, doi:10.1109/TPAMI.1981.4767101
Usage of this product signifies your acceptance of the Terms of Use.