An overview of term rewriting systems

Singh, Dasharath (2012) An overview of term rewriting systems. African Journal of Mathematics and Computer Science Research, 5 (9). ISSN 20069731

[thumbnail of A7B18C44635] Text
A7B18C44635 - Published Version

Download (275kB)

Abstract

It is well-known that termination of finite term of rewriting systems is generally undecidable. NoItwithstanding, a remarkable result is that, rewriting systems are Turing complete. A number of methods have been developed to establish termination for certain term of rewriting systems, particularly occurring in practical situations. In this paper, we present an overview of the existing methods used for termination proofs. We also outline areas of applications of term rewriting systems along with recent developments in regard to automated termination proofs.

Item Type: Article
Subjects: Digital Open Archives > Mathematical Science
Depositing User: Unnamed user with email support@digiopenarchives.com
Date Deposited: 21 Apr 2023 06:18
Last Modified: 23 Sep 2024 04:22
URI: http://geographical.openuniversityarchive.com/id/eprint/912

Actions (login required)

View Item
View Item