![]()  | Department of Mathematics & Computer Science | |||
This is a brief account of work of Brown and Heyworth [1] on extensions of rewriting methods.
The standard expression of such methods is in terms of words 
 in a
free monoid 
 on a set 
. This may be extended to terms
 where 
 belongs to a set 
 and the link between 
 and 
 is in
terms of an action. More precisely, we suppose a monoid 
 acts on the
set 
 on the right, and there is given a morphism of monoids 
:
 where 
 is given by a presentation with generating set
. 
The result of the rewriting will then be normal forms for
the induced action of 
 on 
. This gives an important 
extension of rewrite methods. 
In fact monoids may be replaced by categories, and sets by directed graphs. This gives a formulation in terms of Kan extensions, or induced actions of categories, which we now explain.
|                |   
Author: A. Heyworth, tel: +44 (0)116 252 3884
Last updated: 2000-11-24
MCS Web Maintainer
  This document has been approved by the Head of Department.
© University of Leicester.