Since that the size of the right-hand-side and the number of outgoing d-edges per node are practically bounded by low constants, applying k rules on a tree T yields a linear increase in the size of the forest.
the resulting size is O(|T |+k), as we can see from Figure 3.