{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:TIAAO4DNUA4WFXNFDWNLRCJTMQ","short_pith_number":"pith:TIAAO4DN","schema_version":"1.0","canonical_sha256":"9a0007706da03962dda51d9ab889336432228bdb1a46d238a820f15fa7e69584","source":{"kind":"arxiv","id":"1208.5002","version":1},"attestation_state":"computed","paper":{"title":"A Note on Limited Pushdown Alphabets in Stateless Deterministic Pushdown Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Tom\\'a\\v{s} Masopust","submitted_at":"2012-08-24T15:38:40Z","abstract_excerpt":"Recently, an infinite hierarchy of languages accepted by stateless deterministic pushdown automata has been established based on the number of pushdown symbols. However, the witness language for the n-th level of the hierarchy is over an input alphabet with 2(n-1) elements. In this paper, we improve this result by showing that a binary alphabet is sufficient to establish this hierarchy. As a consequence of our construction, we solve the open problem formulated by Meduna et al. Then we extend these results to m-state realtime deterministic pushdown automata, for all m at least 1. The existence "},"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":"1208.5002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-08-24T15:38:40Z","cross_cats_sorted":[],"title_canon_sha256":"958cfb19f40ada9becbab6732a2bddd1514b008132f8c268ca78ad20130f675b","abstract_canon_sha256":"190cd496082bb627d2af60ed8b5c5d4bcb924e2db305d21f243fc222e0d39017"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:47:52.082176Z","signature_b64":"DNK7waaWjy7MsyWb5hE0U2/fiB5sMRApCeyXGSjcAudR+mYjJGklykbeCSm2zyOu/d0OtzwmBXXcC+dohX4RDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a0007706da03962dda51d9ab889336432228bdb1a46d238a820f15fa7e69584","last_reissued_at":"2026-05-18T03:47:52.081665Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:47:52.081665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on Limited Pushdown Alphabets in Stateless Deterministic Pushdown Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Tom\\'a\\v{s} Masopust","submitted_at":"2012-08-24T15:38:40Z","abstract_excerpt":"Recently, an infinite hierarchy of languages accepted by stateless deterministic pushdown automata has been established based on the number of pushdown symbols. However, the witness language for the n-th level of the hierarchy is over an input alphabet with 2(n-1) elements. In this paper, we improve this result by showing that a binary alphabet is sufficient to establish this hierarchy. As a consequence of our construction, we solve the open problem formulated by Meduna et al. Then we extend these results to m-state realtime deterministic pushdown automata, for all m at least 1. The existence "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.5002","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":"1208.5002","created_at":"2026-05-18T03:47:52.081750+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.5002v1","created_at":"2026-05-18T03:47:52.081750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.5002","created_at":"2026-05-18T03:47:52.081750+00:00"},{"alias_kind":"pith_short_12","alias_value":"TIAAO4DNUA4W","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"TIAAO4DNUA4WFXNF","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"TIAAO4DN","created_at":"2026-05-18T12:27:23.164592+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/TIAAO4DNUA4WFXNFDWNLRCJTMQ","json":"https://pith.science/pith/TIAAO4DNUA4WFXNFDWNLRCJTMQ.json","graph_json":"https://pith.science/api/pith-number/TIAAO4DNUA4WFXNFDWNLRCJTMQ/graph.json","events_json":"https://pith.science/api/pith-number/TIAAO4DNUA4WFXNFDWNLRCJTMQ/events.json","paper":"https://pith.science/paper/TIAAO4DN"},"agent_actions":{"view_html":"https://pith.science/pith/TIAAO4DNUA4WFXNFDWNLRCJTMQ","download_json":"https://pith.science/pith/TIAAO4DNUA4WFXNFDWNLRCJTMQ.json","view_paper":"https://pith.science/paper/TIAAO4DN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.5002&json=true","fetch_graph":"https://pith.science/api/pith-number/TIAAO4DNUA4WFXNFDWNLRCJTMQ/graph.json","fetch_events":"https://pith.science/api/pith-number/TIAAO4DNUA4WFXNFDWNLRCJTMQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TIAAO4DNUA4WFXNFDWNLRCJTMQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TIAAO4DNUA4WFXNFDWNLRCJTMQ/action/storage_attestation","attest_author":"https://pith.science/pith/TIAAO4DNUA4WFXNFDWNLRCJTMQ/action/author_attestation","sign_citation":"https://pith.science/pith/TIAAO4DNUA4WFXNFDWNLRCJTMQ/action/citation_signature","submit_replication":"https://pith.science/pith/TIAAO4DNUA4WFXNFDWNLRCJTMQ/action/replication_record"}},"created_at":"2026-05-18T03:47:52.081750+00:00","updated_at":"2026-05-18T03:47:52.081750+00:00"}