研究了一元术语重写系统（TRS），即仅包含一元函数符号和常量的签名的术语重写。通过将术语转化为字符串，将TRS转化为相应的字符串重写系统（SRS）。发现一元TRS的终止性等价于对应SRS的终止性，这为证明一元TRS的终止性提供了一种新方法。然而，对于其他性质如归约性、唯一正常形式和弱归约，这种转化并不保持其等价性。
Abstract
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.
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
