Abstract
We show that the uniform termination problem is undecidable for length-preserving semi-Thue systems having 10 rules. We then give an explicit uniformly-terminating semi-Thue system \(\mathcal{T}\) having 9 rules which is “universal with respect to termination problems” in some sense.It follows that there exists a fixed rule \({u_0},{v_0}\) such that \(\mathcal{T} \cup \left\{ {\left( {{u_0},{v_0}} \right)} \right\}\) has 10 rules and undecidable termination problem.
This work has been supported by the ESPRIT Basic Research Working Group “COMPUGRAPH II”
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sénizergues, G. (1993). Some undecidable termination problems for semi-Thue systems. In: Kirchner, C. (eds) Rewriting Techniques and Applications. RTA 1993. Lecture Notes in Computer Science, vol 690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21551-7_32
Download citation
DOI: https://doi.org/10.1007/978-3-662-21551-7_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56868-1
Online ISBN: 978-3-662-21551-7
eBook Packages: Springer Book Archive