where V N and V T are disjoint alphabets of non-terminal and terminal symbols, respectively, S ∈ V N is the start symbol, and I and A are finite sets of initial and auxiliary trees, respectively.
the definition of TT-MCTAG imposes that the head tree of each tuple contains at least one lexical element.