Push computations can be composed recursively: combining two consecutive push computations followed by a reduce transition yields a new push operation.
the derivation of a sentence under the transition system can be seen as a composition of push computations.