论文信息 - A Solution to Zantema's Problem

A Solution to Zantema's Problem

Hans Zantema raised the question: Does the one-rule string rewriting system OOII ! IIIOOO terminate? Two successful termination proofs have been given by Nachum Der-showitz: One by minimal counterexample, and the other, by a forward closure argument. We give a diierent, more constructive, termination proof, following Zantema's original proof attempt, and using Bellegarde/Lescanne's transformation order method to verify a subtle transformation step.

Alfons GESER | coise Bellegarde | coise Bellegarde | Alfons Geser

[1] D. Knuth,et al. Simple Word Problems in Universal Algebras , 1983 .

[2] Nachum Dershowitz,et al. Topics in Termination , 1993, RTA.

[3] Nachum Dershowitz. Orderings for Term-Rewriting Systems , 1979, FOCS.

[4] Françoise Bellegarde,et al. Transformation Ordering , 1987, TAPSOFT, Vol.1.

[5] N. A C H U M D E R S H O W I T Z. Termination of Rewriting' , 2022 .

[6] Pierre Lescanne,et al. Rewrite Orderings and Termination of Rewrite Systems , 1991, MFCS.

[7] Gérard Huet,et al. On the Uniform Halting Problem for Term Rewriting Systems , 1978 .