Dasharath Singh - Academia.edu (original) (raw)
Uploads
Papers by Dasharath Singh
Mathematical Theory and Modeling, 2013
In this expository paper, a comprehensive study of multiset orderings, nested multiset orderings ... more In this expository paper, a comprehensive study of multiset orderings, nested multiset orderings and multiset path orderings is presented. In particular, it is illustrated how multiset path orderings admit the use of relatively simple and intuitive termination functions that lead to termination of a class of term rewriting systems.
African Journal of Mathematics and Computer Science Research, 2012
It is well-known that termination of finite term of rewriting systems is generally undecidable. N... more It is well-known that termination of finite term of rewriting systems is generally undecidable. Notwithstanding, 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.
International Journal of Innovation, Management and Technology, 2013
In this paper, some new properties of compatibility classes of a finite set endowed with a suitab... more In this paper, some new properties of compatibility classes of a finite set endowed with a suitable compatibility relation are described. An algorithm to compute maximal compatibility classes is constructed and an application of maximal compatibles to network segmentation and decentralization is demonstrated.
Mathematical Theory and Modeling, 2013
In this expository paper, a comprehensive study of multiset orderings, nested multiset orderings ... more In this expository paper, a comprehensive study of multiset orderings, nested multiset orderings and multiset path orderings is presented. In particular, it is illustrated how multiset path orderings admit the use of relatively simple and intuitive termination functions that lead to termination of a class of term rewriting systems.
African Journal of Mathematics and Computer Science Research, 2012
It is well-known that termination of finite term of rewriting systems is generally undecidable. N... more It is well-known that termination of finite term of rewriting systems is generally undecidable. Notwithstanding, 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.
International Journal of Innovation, Management and Technology, 2013
In this paper, some new properties of compatibility classes of a finite set endowed with a suitab... more In this paper, some new properties of compatibility classes of a finite set endowed with a suitable compatibility relation are described. An algorithm to compute maximal compatibility classes is constructed and an application of maximal compatibles to network segmentation and decentralization is demonstrated.