{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:NVK35XFVCQTLJGCVX53DCKHUX4","short_pith_number":"pith:NVK35XFV","schema_version":"1.0","canonical_sha256":"6d55bedcb51426b49855bf763128f4bf3df2ae7e80bf7c5de70164bf05148c2b","source":{"kind":"arxiv","id":"1104.3634","version":1},"attestation_state":"computed","paper":{"title":"Two-tape finite automata with quantum and classical states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daowen Qiu, Lvzhou Li, Shenggen Zheng","submitted_at":"2011-04-19T04:16:01Z","abstract_excerpt":"{\\it Two-way finite automata with quantum and classical states} (2QCFA) were introduced by Ambainis and Watrous, and {\\it two-way two-tape deterministic finite automata} (2TFA) were introduced by Rabin and Scott. In this paper we study 2TFA and propose a new computing model called {\\it two-way two-tape finite automata with quantum and classical states} (2TQCFA). First, we give efficient 2TFA algorithms for recognizing languages which can be recognized by 2QCFA. Second, we give efficient 2TQCFA algorithms to recognize several languages whose status vis-a-vis 2QCFA have been posed as open questi"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1104.3634","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-04-19T04:16:01Z","cross_cats_sorted":[],"title_canon_sha256":"aa71281ec9960accc97fe6ea7817e4bc4c1f82622890a13b78b8e35f94bf6986","abstract_canon_sha256":"1a84d64ca0a35e8719a35c1436024f34e07ffe1107089dd433f949e8927e2bfe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:55.894793Z","signature_b64":"SJPF3Skpk/ysd6xaXnogKGqShDKu/PUig/VwL6FYQ0aSzIJHOqy1XyXT8Nv5te/HQHY6Y0CqBSmtOs1DYYHpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d55bedcb51426b49855bf763128f4bf3df2ae7e80bf7c5de70164bf05148c2b","last_reissued_at":"2026-05-18T04:23:55.894324Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:55.894324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-tape finite automata with quantum and classical states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daowen Qiu, Lvzhou Li, Shenggen Zheng","submitted_at":"2011-04-19T04:16:01Z","abstract_excerpt":"{\\it Two-way finite automata with quantum and classical states} (2QCFA) were introduced by Ambainis and Watrous, and {\\it two-way two-tape deterministic finite automata} (2TFA) were introduced by Rabin and Scott. In this paper we study 2TFA and propose a new computing model called {\\it two-way two-tape finite automata with quantum and classical states} (2TQCFA). First, we give efficient 2TFA algorithms for recognizing languages which can be recognized by 2QCFA. Second, we give efficient 2TQCFA algorithms to recognize several languages whose status vis-a-vis 2QCFA have been posed as open questi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3634","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1104.3634","created_at":"2026-05-18T04:23:55.894401+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.3634v1","created_at":"2026-05-18T04:23:55.894401+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3634","created_at":"2026-05-18T04:23:55.894401+00:00"},{"alias_kind":"pith_short_12","alias_value":"NVK35XFVCQTL","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"NVK35XFVCQTLJGCV","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"NVK35XFV","created_at":"2026-05-18T12:26:37.096874+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NVK35XFVCQTLJGCVX53DCKHUX4","json":"https://pith.science/pith/NVK35XFVCQTLJGCVX53DCKHUX4.json","graph_json":"https://pith.science/api/pith-number/NVK35XFVCQTLJGCVX53DCKHUX4/graph.json","events_json":"https://pith.science/api/pith-number/NVK35XFVCQTLJGCVX53DCKHUX4/events.json","paper":"https://pith.science/paper/NVK35XFV"},"agent_actions":{"view_html":"https://pith.science/pith/NVK35XFVCQTLJGCVX53DCKHUX4","download_json":"https://pith.science/pith/NVK35XFVCQTLJGCVX53DCKHUX4.json","view_paper":"https://pith.science/paper/NVK35XFV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.3634&json=true","fetch_graph":"https://pith.science/api/pith-number/NVK35XFVCQTLJGCVX53DCKHUX4/graph.json","fetch_events":"https://pith.science/api/pith-number/NVK35XFVCQTLJGCVX53DCKHUX4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NVK35XFVCQTLJGCVX53DCKHUX4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NVK35XFVCQTLJGCVX53DCKHUX4/action/storage_attestation","attest_author":"https://pith.science/pith/NVK35XFVCQTLJGCVX53DCKHUX4/action/author_attestation","sign_citation":"https://pith.science/pith/NVK35XFVCQTLJGCVX53DCKHUX4/action/citation_signature","submit_replication":"https://pith.science/pith/NVK35XFVCQTLJGCVX53DCKHUX4/action/replication_record"}},"created_at":"2026-05-18T04:23:55.894401+00:00","updated_at":"2026-05-18T04:23:55.894401+00:00"}