ISBN:  Unavailable

Category: Unavailable

Page count: 87

This report presents an algorithm for the inference of tree grammars and its application to pattern recognition. The algorithm takes each sample tree of a pattern class and expresses it as a set of expansive productions capable of generating only that sample tree. The procedure is then generalized by making combinations of nonterminals within each set based on the properties of self embedding, regularity and equivalence.