Minimization of deterministic tree grammars and automata
Alejandro Barrero, Rafael C. Gonzalez · 1976
The efficient use of tree representations in pattern recognition requires the construction of deterministic tree automata with a minimum number of states. The conditions for minimization of tree automata are extended and algorithms for the elimination of useless symbols are presented.