Ascending tree automata recognize a wider class of languages (Nivat and Podelski, 1!197;G~cseg and Steinby, 1984) and, therefore, they allow for richer descriptions.
our model will compute the expansion probability for a given node as a function of the subtree of depth k -2 that the node generates 1, i.e., every state stores a subtree of depth k -2.