Abstract
We consider unary term rewriting, i.e., term rewriting with unary signatures where all function symbols are either unary or constants. Terms over such signatures can be transformed into strings by just reading all symbols in the term from left to right, ignoring the optional variable. By lifting this transformation to rewrite rules, any unary term rewrite system (TRS) is transformed into a corresponding string rewrite system (SRS). We investigate which properties are preserved by this transformation. It turns out that any TRS over a unary signature is terminating if and only if the corresponding SRS is terminating. In this way tools for proving termination of string rewriting can be applied for proving termination of unary TRSs. For other rewriting properties including confluence, unique normal form property, weak normalization and relative termination, we show that a similar corresponding preservation property does not hold.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theor. Comp. Sci. 236, 133–178 (2000)
Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, London (1998)
Giesl, J., Thiemann, R., Schneider-Kamp, P.: The dependency pair framework: combining techniques for automated termination proofs. In: Proc. 11th LPAR, LNAI 3452, pp. 301–331 (2005)
Giesl, J., Schneider-Kamp, P., Thiemann, R.: AProVE 1.2: Automatic termination proofs in the dependency pair framework. In: Proc. 3rd IJCAR, LNAI 4130, pp. 281–286 (2006). Tool: http://aprove.informatik.rwth-aachen.de/
Terese: Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science 55. Cambridge University Press, London (2003)
Zantema, H.: Termination of term rewriting by semantic labelling. Fundam. Inform. 24, 89–105 (1995)
Zantema, H.: Termination of string rewriting proved automatically. J. Autom. Reason. 34, 105–139 (2005). Tool: http://www.win.tue.nl/~hzantema/torpa.html.
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the Deutsche Forschungsgemeinschaft DFG under grant GI 274/5-1. This research was done while the first author was at the LuFG Informatik 2, RWTH Aachen.
Rights and permissions
About this article
Cite this article
Thiemann, R., Zantema, H., Giesl, J. et al. Adding constants to string rewriting. AAECC 19, 27–38 (2008). https://doi.org/10.1007/s00200-008-0060-6
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00200-008-0060-6