{
  "annotation_id": "9c081fab-8ea0-4f64-8be7-e8018e697ad1",
  "date_created": "2026-03-02T18:02:41.701000Z",
  "date_modified": "2026-03-02T18:02:41.701000Z",
  "file_hash": "884fb208031b02ad9c92907a23510008e3c7c1c5156959dd6deb6470d49d7732",
  "private": false,
  "record": {
    "abstract": "To study quantum computation, it might be helpful to generalize structures\nfrom language and automata theory to the quantum case. To that end, we propose\nquantum versions of finite-state and push-down automata, and regular and\ncontext-free grammars. We find analogs of several classical theorems, including\npumping lemmas, closure properties, rational and algebraic generating\nfunctions, and Greibach normal form. We also show that there are quantum\ncontext-free languages that are not context-free.",
    "arxiv_id": "quant-ph/9707031",
    "authors": [
      "Cristopher Moore",
      "James P. Crutchfield"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Quantum Automata and Quantum Grammars",
    "url": "https://arxiv.org/abs/quant-ph/9707031"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "fcb0dbbf-7569-4f79-8f1b-68ac476899c7",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}