A complete characterization of termination of 0p1q → 1r0s

Abstract

We completely characterize termination of one-rule string rewriting systems of the form 0p1q → 1r0s for every choice of positive integers p, q, r, and s. For the simply terminating cases, we give a sharp estimate of the complexity of derivation lengths.