The same complexity analysis applies for re-stricted V-TAG.
we can provide a somewhat tighter bound by noting that the rank, r, of the grammar-how many tree sets adjoin in a single tree-and the fan out, f of the grammar-how many trees may be in a single tree set-are limited by t. That is, a complete derivation containing |D| tree sets can contain no more than t |D| individual trees and also no more than rf |D| individual trees.