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

  • Hans Zantema
  • Alfons Geser

DOI: 10.1007/s002009900019

Cite this article as:
Zantema, H. & Geser, A. AAECC (2000) 11: 1. doi:10.1007/s002009900019

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.

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

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Hans Zantema
    • 1
  • Alfons Geser
    • 2
  1. 1.Universiteit Utrecht, P.O. Box 80089, 3508 Utrecht, The Netherlands (e-mail: hansz@cs.ruu.nl)NL
  2. 2.Alte Strasse 42, 94034 Passau, Germany (e-mail: geser@fmi.uni-passau.de)DE

Personalised recommendations