{
  "id": "math/9901044",
  "version": "v1",
  "published": "1999-01-11T09:15:08.000Z",
  "updated": "1999-01-11T09:15:08.000Z",
  "title": "Rewriting as a Special Case of Noncommutative Groebner Basis Theory",
  "authors": [
    "Anne Heyworth"
  ],
  "comment": "article, 4 pages, LaTeX2e",
  "categories": [
    "math.CO"
  ],
  "abstract": "Rewriting for semigroups is a special case of Groebner basis theory for noncommutative polynomial algebras. The fact is a kind of folklore but is not fully recognised. The aim of this paper is to elucidate this relationship, showing that the noncommutative Buchberger algorithm corresponds step-by-step to the Knuth-Bendix completion procedure.",
  "revisions": [
    {
      "version": "v1",
      "updated": "1999-01-11T09:15:08.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "68Q42",
      "16S15",
      "68Q40"
    ],
    "keywords": [
      "noncommutative groebner basis theory",
      "special case",
      "noncommutative buchberger algorithm corresponds step-by-step",
      "knuth-bendix completion procedure"
    ],
    "note": {
      "typesetting": "LaTeX",
      "pages": 4,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "1999math......1044H"
    }
  }
}