ON TERMINATION PROBLEM IN TERM REWRITING عن مسألة الانتهاء في تحوير الحدود
Mohammad Hashim Ali Abd El-Rahman;
Abstract
Term Rewriting System (TRS) is a formal computational model, based on rewriting, in which equals are replaced by equals in a match-and-substitute manner. TRS is as strong as Turing machines, and it has many applications in various fields of computer scien
Other data
| Title | ON TERMINATION PROBLEM IN TERM REWRITING عن مسألة الانتهاء في تحوير الحدود | Authors | Mohammad Hashim Ali Abd El-Rahman | Keywords | ON TERMINATION PROBLEM IN TERM REWRITING عن مسألة الانتهاء في تحوير الحدود | Issue Date | 2006 | Description | Term Rewriting System (TRS) is a formal computational model, based on rewriting, in which equals are replaced by equals in a match-and-substitute manner. TRS is as strong as Turing machines, and it has many applications in various fields of computer scien |
Recommend this item
Similar Items from Core Recommender Database
Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.