{
  "annotation_id": "826c7436-cc26-4047-a01e-5bc3a7116790",
  "date_created": "2026-03-02T18:01:34.827000Z",
  "date_modified": "2026-03-02T18:01:34.827000Z",
  "file_hash": "2c21b797d231a32b96ae2e82682f5f74b4eadae4ad2613385d6f38388ca33ab2",
  "private": false,
  "record": {
    "abstract": "In this paper we develop little further the theory of quantum finite automata\n(QFA). There are already few properties of QFA known, that deterministic and\nprobabilistic finite automata do not have e.g. they cannot recognize all\nregular languages. In this paper we show, that class of languages recognizable\nby QFA is not closed under union, even not under any Boolean operation, where\nboth arguments are significant.",
    "arxiv_id": "quant-ph/0001005",
    "authors": [
      "Maris Valdats"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "The class of languages recognizable by 1-way quantum finite automata is   not closed under union",
    "url": "https://arxiv.org/abs/quant-ph/0001005"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "9687f5f2-6583-4b1e-8fc5-81ae105aa9e2",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}