We use T Σ (X) to denote the set of arbitrarily sized trees constructed from ranked alphabet Σ having items from set X at some leaf positions.
t Σ (X) is the smallest set such that X ⊂ t Σ (X) and σ(t 1 , .