Skip to main content
SpringerLink
Log in

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

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

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, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Universiteit Utrecht, P.O. Box 80089, 3508 Utrecht, The Netherlands (e-mail: hansz@cs.ruu.nl), , , , , , NL

    Hans Zantema

  2. Alte Strasse 42, 94034 Passau, Germany (e-mail: geser@fmi.uni-passau.de), , , , , , DE

    Alfons Geser

Authors
  1. Hans Zantema
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alfons Geser
    View author publications

    You can also search for this author in PubMed Google Scholar

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

Search

Navigation