In this paper, we introduce a concept of computation process on colored finite trees, which symbolize an inheritance process between fathers and sons, aiming to investigate their termination properties. We develop formal techniques to analyze their behavior and we present various results regarding the termination of computations performed on these trees. We show that these results can be generalized to digraphs through a simple transformation.