| Authors |
|
| Publication date |
2004
|
| Journal |
Information and Computation
|
| Volume | Issue number |
195 | 1-2
|
| Pages (from-to) |
66-87
|
| Number of pages |
22
|
| Organisations |
-
Faculty of Science (FNWI) - Informatics Institute (IVI)
|
| Abstract |
We carry out a detailed analysis of Thatte¿s transformation of term rewriting systems. We refute an earlier claim that this transformation preserves confluence for weakly persistent systems. We prove the preservation of weak normalization, and of confluence in weakly normalizing systems and in nonoverlapping systems with linear subtemplates. We conclude by proving that weak persistence is an undecidable property of term rewriting systems.
|
| Document type |
Article
|
| Published at |
https://doi.org/10.1016/j.ic.2003.09.006
|
|
Permalink to this page
|