{
  "id": "1811.11691",
  "version": "v1",
  "published": "2018-11-28T17:18:47.000Z",
  "updated": "2018-11-28T17:18:47.000Z",
  "title": "Autostackability of Thompson's group $F$",
  "authors": [
    "Nathan Corwin",
    "Gili Golan",
    "Susan Hermiller",
    "Ashley Johnson",
    "Zoran Sunic"
  ],
  "comment": "21 pages",
  "categories": [
    "math.GR",
    "cs.FL"
  ],
  "abstract": "The word problem for Thompson's group $F$ has a solution, but it remains unknown whether $F$ is automatic or has a finite or regular convergent (terminating and confluent) rewriting system. We show that the group $F$ admits a natural extension of these two properties, namely autostackability, and we give an explicit bounded regular convergent prefix-rewriting system for $F$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2018-11-28T17:18:47.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "20F10",
      "20F65",
      "68Q42"
    ],
    "keywords": [
      "thompsons group",
      "autostackability",
      "bounded regular convergent prefix-rewriting system",
      "natural extension",
      "explicit bounded regular convergent prefix-rewriting"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 21,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}