{
  "id": "math/0612178",
  "version": "v1",
  "published": "2006-12-07T04:49:43.000Z",
  "updated": "2006-12-07T04:49:43.000Z",
  "title": "Groups generated by 3-state automata over a 2-letter alphabet, I",
  "authors": [
    "Ievgen Bondarenko",
    "Rostislav Grigorchuk",
    "Rostyslav Kravchenko",
    "Yevgen Muntyan",
    "Volodymyr Nekrashevych",
    "Dmytro Savchuk",
    "Zoran Sunic"
  ],
  "comment": "37 pages, 52 figures",
  "categories": [
    "math.GR"
  ],
  "abstract": "An approach to a classification of groups generated by 3-state automata over a 2-letter alphabet and the current progress in this direction are presented. Several results related to the whole class are formulated. In particular, all finite, abelian, and free groups are classified. In addition, we provide detailed information and complete proofs for several groups from the class, with the intention of showing the main methods and techniques used in the classification.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2006-12-07T04:49:43.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "20E08"
    ],
    "keywords": [
      "main methods",
      "classification",
      "free groups",
      "complete proofs"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 37,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2006math.....12178B"
    }
  }
}