{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:4NQATKKJFHEANZ56II74L7OUZ5","short_pith_number":"pith:4NQATKKJ","schema_version":"1.0","canonical_sha256":"e36009a94929c806e7be423fc5fdd4cf487ec466f2a1ae1a7438eb835495fe0f","source":{"kind":"arxiv","id":"2008.04667","version":1},"attestation_state":"computed","paper":{"title":"On the Complexity of the Universality and Inclusion Problems for Unambiguous Context-Free Grammars","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Lorenzo Clemente (University of Warsaw)","submitted_at":"2020-08-07T01:22:41Z","abstract_excerpt":"We study the computational complexity of universality and inclusion problems for unambiguous finite automata and context-free grammars. We observe that several such problems can be reduced to the universality problem for unambiguous context-free grammars. The latter problem has long been known to be decidable and we propose a PSPACE algorithm that works by reduction to the zeroness problem of recurrence equations with convolution. We are not aware of any non-trivial complexity lower bounds. However, we show that computing the coin-flip measure of an unambiguous context-free language, a quantit"},"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":"2008.04667","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2020-08-07T01:22:41Z","cross_cats_sorted":[],"title_canon_sha256":"f28b518d7ef89542aaac46f64ddbda4b210f63d9a1e8c249ba944e873b187aa6","abstract_canon_sha256":"3102ecd13d8a01bad3a1a13c91242acafcf03f1092bc23b7de5efca61555e759"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:26:27.718537Z","signature_b64":"i1o1qi3rQrtA8TjlIhKX+1tI5qp6xRMabUyWvRluxVTCtPpZvW3YwRYZtbVCWW9c8t6HXVgnz9iQHfu+gRZoCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e36009a94929c806e7be423fc5fdd4cf487ec466f2a1ae1a7438eb835495fe0f","last_reissued_at":"2026-07-05T01:26:27.718093Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:26:27.718093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of the Universality and Inclusion Problems for Unambiguous Context-Free Grammars","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Lorenzo Clemente (University of Warsaw)","submitted_at":"2020-08-07T01:22:41Z","abstract_excerpt":"We study the computational complexity of universality and inclusion problems for unambiguous finite automata and context-free grammars. We observe that several such problems can be reduced to the universality problem for unambiguous context-free grammars. The latter problem has long been known to be decidable and we propose a PSPACE algorithm that works by reduction to the zeroness problem of recurrence equations with convolution. We are not aware of any non-trivial complexity lower bounds. However, we show that computing the coin-flip measure of an unambiguous context-free language, a quantit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.04667","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2008.04667/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2008.04667","created_at":"2026-07-05T01:26:27.718151+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.04667v1","created_at":"2026-07-05T01:26:27.718151+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.04667","created_at":"2026-07-05T01:26:27.718151+00:00"},{"alias_kind":"pith_short_12","alias_value":"4NQATKKJFHEA","created_at":"2026-07-05T01:26:27.718151+00:00"},{"alias_kind":"pith_short_16","alias_value":"4NQATKKJFHEANZ56","created_at":"2026-07-05T01:26:27.718151+00:00"},{"alias_kind":"pith_short_8","alias_value":"4NQATKKJ","created_at":"2026-07-05T01:26:27.718151+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/4NQATKKJFHEANZ56II74L7OUZ5","json":"https://pith.science/pith/4NQATKKJFHEANZ56II74L7OUZ5.json","graph_json":"https://pith.science/api/pith-number/4NQATKKJFHEANZ56II74L7OUZ5/graph.json","events_json":"https://pith.science/api/pith-number/4NQATKKJFHEANZ56II74L7OUZ5/events.json","paper":"https://pith.science/paper/4NQATKKJ"},"agent_actions":{"view_html":"https://pith.science/pith/4NQATKKJFHEANZ56II74L7OUZ5","download_json":"https://pith.science/pith/4NQATKKJFHEANZ56II74L7OUZ5.json","view_paper":"https://pith.science/paper/4NQATKKJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.04667&json=true","fetch_graph":"https://pith.science/api/pith-number/4NQATKKJFHEANZ56II74L7OUZ5/graph.json","fetch_events":"https://pith.science/api/pith-number/4NQATKKJFHEANZ56II74L7OUZ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4NQATKKJFHEANZ56II74L7OUZ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4NQATKKJFHEANZ56II74L7OUZ5/action/storage_attestation","attest_author":"https://pith.science/pith/4NQATKKJFHEANZ56II74L7OUZ5/action/author_attestation","sign_citation":"https://pith.science/pith/4NQATKKJFHEANZ56II74L7OUZ5/action/citation_signature","submit_replication":"https://pith.science/pith/4NQATKKJFHEANZ56II74L7OUZ5/action/replication_record"}},"created_at":"2026-07-05T01:26:27.718151+00:00","updated_at":"2026-07-05T01:26:27.718151+00:00"}