{
  "id": "math/0301211",
  "version": "v1",
  "published": "2003-01-20T06:46:31.000Z",
  "updated": "2003-01-20T06:46:31.000Z",
  "title": "Binary trees and fibred categories",
  "authors": [
    "N. Raghavendra"
  ],
  "comment": "19 pages",
  "categories": [
    "math.CO",
    "cs.DM",
    "math.CT"
  ],
  "abstract": "We develop a purely set-theoretic formalism for binary trees and binary graphs. We define a category of binary automata, and display it as a fibred category over the category of binary graphs. We also relate the notion of binary graphs to transition systems, which arise in the theory of concurrent computing.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2003-01-20T06:46:31.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C05",
      "18D30",
      "05C62",
      "18B20",
      "68Q85"
    ],
    "keywords": [
      "binary trees",
      "fibred category",
      "binary graphs",
      "binary automata",
      "purely set-theoretic formalism"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 19,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2003math......1211R"
    }
  }
}