One of the DP transformations only available for innermost-termination is rewriting:
an SCC consisting of pairs P ∪ { s → t } over a set of rules R can be rewritten to
P ∪ {s → t'} iff U(t|p) is non-overlapping and t|p → t', where
p is the position of the R-redex.