The construction algorithm and a sketch of the proof are presented in the appendix.
of this theorem, the following corollary holds: For a given n, the string languages generated by RSN-MCTAGs of arity n are mildly context-sensitive, and they are in particular polynomially parsable.