{
  "annotation_id": "9829a242-605b-46b2-a443-b19ca99bded3",
  "date_created": "2026-03-02T18:01:59.603000Z",
  "date_modified": "2026-03-02T18:01:59.603000Z",
  "file_hash": "17249dbe58e68350df338febbe09b546c2fb6d364866dd24c57540229733c106",
  "private": false,
  "record": {
    "abstract": "We study the following decision problem: is the language recognized by a\nquantum finite automaton empty or non-empty? We prove that this problem is\ndecidable or undecidable depending on whether recognition is defined by strict\nor non-strict thresholds. This result is in contrast with the corresponding\nsituation for probabilistic finite automata for which it is known that strict\nand non-strict thresholds both lead to undecidable problems.",
    "arxiv_id": "quant-ph/0304082",
    "authors": [
      "Vincent D. Blondel",
      "Emmanuel Jeandel",
      "Pascal Koiran",
      "Natacha Portier"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Decidable and undecidable problems about quantum automata",
    "url": "https://arxiv.org/abs/quant-ph/0304082"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "748b2846-6a93-438a-9e6f-124f72c58747",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}