Ronald Brown, Anne Heyworth
Published 1999-03-05Version 1
The basic method of rewriting for words in a free monoid given a monoid presentation is extended to rewriting for paths in a free category given a `Kan extension presentation'. This is related to work of Carmody-Walters on the Todd-Coxeter procedure for Kan extensions, but allows for the output data to be infinite, described by a language. The result also allows rewrite methods to be applied in a greater range of situations and examples, in terms of induced actions of monoids, categories, groups or groupoids.
Comments: 31 pages, LaTeX2e, (submitted to JSC)
Rewriting Procedures Generalise to Kan Extensions of Actions of Categories
A syntactic approach to the MacNeille completion of $\boldΛ^{\ast}$, the free monoid over an ordered alphabet $\bold Λ$
Directed animals, quadratic and rewriting systems
![QR code for arXiv:math/9903032 [math.CO]](http://oss.arxitics.com/images/favicon.svg)