{
  "annotation_id": "7df3d7e0-4573-4932-b46c-f3cc392acbfb",
  "date_created": "2026-03-02T18:01:38.627000Z",
  "date_modified": "2026-03-02T18:01:38.627000Z",
  "file_hash": "7d5c77437be6016c197376f993640a2b6b9a39c72f9b8ce1e9365ab90cea7522",
  "private": false,
  "record": {
    "abstract": "It is an open problem to characterize the class of languages recognized by\nquantum finite automata (QFA). We examine some necessary and some sufficient\nconditions for a (regular) language to be recognizable by a QFA. For a subclass\nof regular languages we get a condition which is necessary and sufficient.\n  Also, we prove that the class of languages recognizable by a QFA is not\nclosed under union or any other binary Boolean operation where both arguments\nare significant.",
    "arxiv_id": "quant-ph/0009004",
    "authors": [
      "Andris Ambainis",
      "Arnolds Kikusts",
      "Maris Valdats"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "On the class of languages recognizable by 1-way quantum finite automata",
    "url": "https://arxiv.org/abs/quant-ph/0009004"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "db9a4bcc-1ce5-4ca2-8b59-1e9222bce09e",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}