{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JXUBU2HSJOO6FAQ6CJA5XJ7ZVC","short_pith_number":"pith:JXUBU2HS","schema_version":"1.0","canonical_sha256":"4de81a68f24b9de2821e1241dba7f9a8887aafb129597d8bd13a69bdb0406347","source":{"kind":"arxiv","id":"1806.06562","version":1},"attestation_state":"computed","paper":{"title":"Deque languages, automata and planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Pierluigi San Pietro, Stefano Crespi Reghizzi","submitted_at":"2018-06-18T09:14:47Z","abstract_excerpt":"The memory of a deque (double ended queue) automaton is more general than a queue or two stacks; to avoid overgeneralization, we consider quasi-real-time operation. Normal forms of such automata are given. Deque languages form an AFL but not a full one. We define the characteristic deque language, CDL, which combines Dyck and AntiDyck (or FIFO) languages, and homomorphically characterizes the deque languages. The notion of deque graph, from graph theory, well represents deque computation by means of a planar hamiltonian graph on a cylinder, with edges visualizing producer-consumer relations fo"},"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":"1806.06562","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-06-18T09:14:47Z","cross_cats_sorted":[],"title_canon_sha256":"3b4ec0b47565ffa6a5031406c2a367dffe196c2409d153d8f9e9a3f7ec6c4b38","abstract_canon_sha256":"f251fa9e522a52b7d6956ae70f46a37dccf17c03200f8a5f3f4f3fff3bf5a8bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:01.991428Z","signature_b64":"hi+k8wJsUDsjw6nrW63QNhwv7T8t1cYZomzyCwyToX1NmWIcAcjR/OvoNoYbTJT7rSDxd5tbGk/u+NtUH+MwDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4de81a68f24b9de2821e1241dba7f9a8887aafb129597d8bd13a69bdb0406347","last_reissued_at":"2026-05-18T00:13:01.990774Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:01.990774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deque languages, automata and planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Pierluigi San Pietro, Stefano Crespi Reghizzi","submitted_at":"2018-06-18T09:14:47Z","abstract_excerpt":"The memory of a deque (double ended queue) automaton is more general than a queue or two stacks; to avoid overgeneralization, we consider quasi-real-time operation. Normal forms of such automata are given. Deque languages form an AFL but not a full one. We define the characteristic deque language, CDL, which combines Dyck and AntiDyck (or FIFO) languages, and homomorphically characterizes the deque languages. The notion of deque graph, from graph theory, well represents deque computation by means of a planar hamiltonian graph on a cylinder, with edges visualizing producer-consumer relations fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06562","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":"1806.06562","created_at":"2026-05-18T00:13:01.990858+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.06562v1","created_at":"2026-05-18T00:13:01.990858+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06562","created_at":"2026-05-18T00:13:01.990858+00:00"},{"alias_kind":"pith_short_12","alias_value":"JXUBU2HSJOO6","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"JXUBU2HSJOO6FAQ6","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"JXUBU2HS","created_at":"2026-05-18T12:32:33.847187+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/JXUBU2HSJOO6FAQ6CJA5XJ7ZVC","json":"https://pith.science/pith/JXUBU2HSJOO6FAQ6CJA5XJ7ZVC.json","graph_json":"https://pith.science/api/pith-number/JXUBU2HSJOO6FAQ6CJA5XJ7ZVC/graph.json","events_json":"https://pith.science/api/pith-number/JXUBU2HSJOO6FAQ6CJA5XJ7ZVC/events.json","paper":"https://pith.science/paper/JXUBU2HS"},"agent_actions":{"view_html":"https://pith.science/pith/JXUBU2HSJOO6FAQ6CJA5XJ7ZVC","download_json":"https://pith.science/pith/JXUBU2HSJOO6FAQ6CJA5XJ7ZVC.json","view_paper":"https://pith.science/paper/JXUBU2HS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.06562&json=true","fetch_graph":"https://pith.science/api/pith-number/JXUBU2HSJOO6FAQ6CJA5XJ7ZVC/graph.json","fetch_events":"https://pith.science/api/pith-number/JXUBU2HSJOO6FAQ6CJA5XJ7ZVC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JXUBU2HSJOO6FAQ6CJA5XJ7ZVC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JXUBU2HSJOO6FAQ6CJA5XJ7ZVC/action/storage_attestation","attest_author":"https://pith.science/pith/JXUBU2HSJOO6FAQ6CJA5XJ7ZVC/action/author_attestation","sign_citation":"https://pith.science/pith/JXUBU2HSJOO6FAQ6CJA5XJ7ZVC/action/citation_signature","submit_replication":"https://pith.science/pith/JXUBU2HSJOO6FAQ6CJA5XJ7ZVC/action/replication_record"}},"created_at":"2026-05-18T00:13:01.990858+00:00","updated_at":"2026-05-18T00:13:01.990858+00:00"}