Skip to main content
Article thumbnail
Location of Repository

A complete characterization of termination of 0p1q → 1r0s

By H. Zantema and A. Geser


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

Topics: Wiskunde en Informatica
Year: 1994
OAI identifier:

Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.