We prove that each recursively enumerable language can be generated by
an extended splicing system with targets having finitely many rules o
f radius at most two. (The target of a splicing rule is a regular lang
uage: the rule can be applied to two strings only if the result of the
splicing belongs to the target language.)