2601.19466v1.pdf

{
  "file/base": {
    "record": {
      "extension": ".pdf",
      "hash": "7a2bd587703addf7e74d5466b3b740c059cd86e75a5594faa9024d14541eebca",
      "media_type": "application/pdf",
      "media_type_prefix": "application",
      "name": "2601.19466v1.pdf",
      "size": 1287484
    },
    "source": {
      "execution_id": "65a139a2-39e9-45f8-967d-e4cb38bcc5c7",
      "id": "file/base",
      "type": "Model",
      "version": "1.0.0"
    }
  },
  "file/pdf": {
    "private": false,
    "record": {
      "creation_date": "2026-01-28T01:58:06Z",
      "keywords": [
        "Indexed languages",
        "Higher-order pushdown automata",
        "Downward closures",
        "Semigroups",
        "Verification"
      ],
      "modified_date": "2026-01-28T01:58:06Z",
      "page_count": 25,
      "producer": "pikepdf 8.15.1",
      "subject": "-  Theory of computation  -\u003e  Grammars and context-free languages.Verification by model checking.Algebraic language theory.",
      "title": "The complexity of downward closures of indexed languages",
      "version": "1.7"
    },
    "source": {
      "execution_id": "87b1b6b7-a4d9-4b32-bf4b-2571b17e5a2f",
      "id": "dorsal/pdf",
      "type": "Model",
      "version": "1.1.0"
    }
  }
}