{
  "id": "1501.04313",
  "version": "v1",
  "published": "2015-01-18T15:12:59.000Z",
  "updated": "2015-01-18T15:12:59.000Z",
  "title": "Thompson's group F is 1-counter graph automatic",
  "authors": [
    "Murray Elder",
    "Jennifer Taback"
  ],
  "categories": [
    "math.GR"
  ],
  "abstract": "It is not known whether Thompson's group F is automatic. With the recent extensions of the notion of an automatic group to graph automatic by Kharlampovich, Khoussainov and Miasnikov and then to C-graph automatic by the authors, a compelling question is whether F is graph automatic or C-graph automatic for an appropriate language class C. The extended definitions allow the use of a symbol alphabet for the normal form language, replacing the dependence on generating set. In this paper we construct a 1-counter graph automatic structure for F based on the standard infinite normal form for group elements.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-01-18T15:12:59.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "20F65",
      "68Q45"
    ],
    "keywords": [
      "thompsons group",
      "c-graph automatic",
      "standard infinite normal form",
      "appropriate language class",
      "normal form language"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2015arXiv150104313E"
    }
  }
}