{
  "id": "math/9903032",
  "version": "v1",
  "published": "1999-03-05T12:11:57.000Z",
  "updated": "1999-03-05T12:11:57.000Z",
  "title": "Using Rewriting Systems to Compute Kan Extensions and Induced Actions of Categories",
  "authors": [
    "Ronald Brown",
    "Anne Heyworth"
  ],
  "comment": "31 pages, LaTeX2e, (submitted to JSC)",
  "categories": [
    "math.CO"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "1999-03-05T12:11:57.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "68Q42",
      "18A40",
      "68Q40"
    ],
    "keywords": [
      "induced actions",
      "rewriting systems",
      "kan extension presentation",
      "free monoid",
      "monoid presentation"
    ],
    "note": {
      "typesetting": "LaTeX",
      "pages": 31,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "1999math......3032B"
    }
  }
}