On the distribution of the number of computations in any finite number of subtrees for the stack algorithm (Corresp.)

Multitype branching processes have been employed to determine the stack algorithm computational distribution for one subtree. These results are extended here to the distribution of the number of computations in any finite number of subtrees. Starting from the computational distribution for
K-1
subsequent subtrees, a recurrent equation for the distribution for
K
subsequent subtrees is determined.