113 search results - page 1 / 23 » Complete involutive rewriting systems |
JSC
2007
13 years 7 months ago
2007
Given a monoid string rewriting system M, one way of obtaining a complete rewriting system for M is to use the classical Knuth-Bendix critical pairs completion algorithm. It is we...
AMC
2005
13 years 7 months ago
2005
A constructive algorithm for the completion of arbitrary algebraic partial differential equation systems to involutive ones are presented. Based on it, an implementation ICS for c...
RTA
2011
Springer
12 years 10 months ago
2011
Springer
Given an equational system, completion procedures compute an equivalent and complete (terminating and confluent) term rewrite system. We present a very simple and efficient compl...
MFCS
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. Kamperman and Walters proposed the notion of a simulation of one rewrite system by another one, whereby each term of the simulating rewrite system is related to a term in...
ALP
1992
Springer
13 years 11 months ago
1992
Springer
The paper presents a new schematization of in nite families of terms called the primal grammars, based on the notion of primitive recursive rewrite systems. This schematization is...