Using Rewriting Systems to Compute Kan Extensions and Induced Actions of Categories
Combinatorics
2007-05-23 v1
Abstract
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.
Keywords
Cite
@article{arxiv.math/9903032,
title = {Using Rewriting Systems to Compute Kan Extensions and Induced Actions of Categories},
author = {Ronald Brown and Anne Heyworth},
journal= {arXiv preprint arXiv:math/9903032},
year = {2007}
}
Comments
31 pages, LaTeX2e, (submitted to JSC)