{
  "annotation_id": "2ea685d7-a320-4977-94a5-06a5befd7e32",
  "date_created": "2026-03-02T18:02:47.645000Z",
  "date_modified": "2026-03-02T18:02:47.645000Z",
  "file_hash": "67deba477b4013b2bd23dab2a6909f59e712de26ddbaed8aa7b20da02735ea52",
  "private": false,
  "record": {
    "abstract": "In this paper the notion of quantum finite one-counter automata (QF1CA) is\nintroduced. Introduction of the notion is similar to that of the 2-way quantum\nfinite state automata by A.Kondacs and J.Watrous. The well-formedness\nconditions for the automata are specified ensuring unitarity of evolution. A\nspecial kind of QF1CA, called simple, that satisfies the well-formedness\nconditions is introduced. That allows to specify rules for constructing such\nautomata more naturally and simpler than in general case. Possible models of\nlanguage recognition by QF1CA are considered. The recognition of some languages\nby QF1CA is shown and compared with recognition by probabilistic counterparts.",
    "arxiv_id": "quant-ph/9905092",
    "authors": [
      "Maksim Kravtsev"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Quantum Finite One-Counter Automata",
    "url": "https://arxiv.org/abs/quant-ph/9905092"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "393dffb8-ff36-4b35-8842-db70b8e5516d",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}