A Complete Characterization of Termination of 0p 1q→ 1r 0s
- 34 Downloads
We characterize termination of one-rule string rewriting systems of the form 0 p 1 q → 1 r 0 s for every choice of positive integers p, q, r, and s. In doing so we introduce a termination proof method that applies to some hard examples. For the simply terminating cases, i.e. string rewriting systems that can be ordered by a division order, we give the precise complexity of derivation lengths.
Unable to display preview. Download preview PDF.