Skip to main content

A Complete Characterization of Termination of 0p 1q→ 1r 0s

Abstract.

We characterize termination of one-rule string rewriting systems of the form 0p 1q→ 1r 0s 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.

This is a preview of subscription content, access via your institution.

Author information

Authors and Affiliations

Authors

Additional information

Received: July 31, 1997; revised version: January 30, 2000

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Zantema, H., Geser, A. A Complete Characterization of Termination of 0p 1q→ 1r 0s. AAECC 11, 1–25 (2000). https://doi.org/10.1007/s002009900019

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002009900019

  • Keywords: String rewriting, Term rewriting, Termination, Simple termination, Transformation ordering, Dummy elimination, Derivation length.