4. The method of claim 1 , wherein the translation involves two finite unordered node labeled trees and the first tree is a full sub tree of the second.
5. The method of claim 4 , wherein the operation f on the first tree results in a sub tree of the operation f on the second tree.