Using Rewriting Systems to Compute Kan Extensions and Induced Actions of Categories

Simple item page
dc.creatorBrown, Ronald
dc.creatorHeyworth, Anne
dc.date1999-03-05
dc.date.accessioned2026-07-07T05:28:13Z
dc.date.available2026-07-07T05:28:13Z
dc.descriptionThe 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.
dc.description31 pages, LaTeX2e, (submitted to JSC)
dc.identifierhttps://arxiv.org/abs/math/9903032
dc.identifierhttp://arxiv.org/abs/math/9903032
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/78180
dc.subjectCombinatorics
dc.subject68Q42 18A40 68Q40
dc.titleUsing Rewriting Systems to Compute Kan Extensions and Induced Actions of Categories
dc.typetext

Files

Collections

arXiv