Term rewriting and all that
The unification problem for confluent right-ground term rewriting systems
Information and Computation - RTA 2001
Reachability and confluence are undecidable for flat term rewriting systems
Information Processing Letters
Algorithms and Reductions for Rewriting Problems
Fundamenta Informaticae
Information Processing Letters
Hi-index | 0.89 |
This paper shows that reachability is undecidable for confluent monadic and semi-constructor TRSs, and that joinability and confluence are undecidable for monadic and semi-constructor TRSs. Here, a TRS is monadic if the height of the right-hand side of each rewrite rule is at most 1, and is semi-constructor if all defined symbols appearing in the right-hand side of each rewrite rule occur only in its ground subterms.