That work clarifies the definitions of MCTAG variants and the relationship between them rather than presenting new complexity results.
it suggests the possibility of proving results such as ours in its assertion that, after a standard TAG parse, a check of whether particular trees belong to the same tree set cannot be performed in polynomial time.