Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems
Access this Article
Yi and Sakai  showed that the termination problem is a decidable property for the class of semi-constructor term rewriting systems, which is a superclass of the class of right ground term rewriting systems. The decidability was shown by the fact that every non-terminating TRS in the class has a loop. In this paper we modify the proof of  to show that both innermost termination and μ-termination are decidable properties for the class of semi-constructor TRSs.
- Proceedings of 7th International Workshop on Reduction Strategies in Rewriting and Programming (WRS2007) Paris
Proceedings of 7th International Workshop on Reduction Strategies in Rewriting and Programming (WRS2007) Paris, 16-27, 2007-06