Some undecidable termination problems for semi-Thue systems

https://doi.org/10.1016/0304-3975(94)00278-9Get rights and content
Under an Elsevier user license
open archive

Abstract

We show that the uniform termination problem is undecidable for length-preserving semi-Thue systems having 9 rules. We then give an explicit uniformly terminating semi-Thue system F having 9 rules which is “universal with respect to termination problems” in some sense. It follows that there exists a fixed rule (u0, v0) such that F ∪ {(u0, v0)} has 10 rules and undecidable termination problem.

Cited by (0)

This work has been supported by the ESPRIT Basic Research Working Group “COMPUGRAPH II”.