{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SDNNLMMPWWK6HVLVACJMKQFYFX","short_pith_number":"pith:SDNNLMMP","schema_version":"1.0","canonical_sha256":"90dad5b18fb595e3d5750092c540b82de3143d59232b7d450f310f903c75a71b","source":{"kind":"arxiv","id":"1705.09695","version":2},"attestation_state":"computed","paper":{"title":"Regularity of languages generated by non context-free grammars over a singleton terminal alphabet","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Alberto Pettorossi, Maurizio Proietti","submitted_at":"2017-05-26T19:46:02Z","abstract_excerpt":"It is well-known that: (i) every context-free language over a singleton terminal alphabet is regular, and (ii) the class of languages that satisfy the Pumping Lemma is a proper super-class of the context-free languages. We show that any language in this superclass over a singleton terminal alphabet is regular. Our proof is based on a transformational approach and does not rely on Parikh's Theorem. Our result extends previously known results because there are languages that are not context-free, do satisfy the Pumping Lemma, and do not satisfy the hypotheses of Parikh's Theorem."},"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":"1705.09695","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-05-26T19:46:02Z","cross_cats_sorted":[],"title_canon_sha256":"c53f952be6b1b426e5294f0c523677ddd3dff523ae294cb41fb0170c4ca6553a","abstract_canon_sha256":"36742b3c1ce8e1fcbb6f5bc5bca754175c41162daf7652064c238d1e15fa3354"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:57.229732Z","signature_b64":"xqgvDPzMFHuXZbQE21kl6kTXtZfzyDSopmN9GVMlWgVnlN4svu+H2QPGyGs0a062LHCQ8GkdKEfuFQRp0zedAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90dad5b18fb595e3d5750092c540b82de3143d59232b7d450f310f903c75a71b","last_reissued_at":"2026-05-18T00:10:57.229015Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:57.229015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regularity of languages generated by non context-free grammars over a singleton terminal alphabet","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Alberto Pettorossi, Maurizio Proietti","submitted_at":"2017-05-26T19:46:02Z","abstract_excerpt":"It is well-known that: (i) every context-free language over a singleton terminal alphabet is regular, and (ii) the class of languages that satisfy the Pumping Lemma is a proper super-class of the context-free languages. We show that any language in this superclass over a singleton terminal alphabet is regular. Our proof is based on a transformational approach and does not rely on Parikh's Theorem. Our result extends previously known results because there are languages that are not context-free, do satisfy the Pumping Lemma, and do not satisfy the hypotheses of Parikh's Theorem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09695","kind":"arxiv","version":2},"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":"1705.09695","created_at":"2026-05-18T00:10:57.229111+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.09695v2","created_at":"2026-05-18T00:10:57.229111+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09695","created_at":"2026-05-18T00:10:57.229111+00:00"},{"alias_kind":"pith_short_12","alias_value":"SDNNLMMPWWK6","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SDNNLMMPWWK6HVLV","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SDNNLMMP","created_at":"2026-05-18T12:31:43.269735+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/SDNNLMMPWWK6HVLVACJMKQFYFX","json":"https://pith.science/pith/SDNNLMMPWWK6HVLVACJMKQFYFX.json","graph_json":"https://pith.science/api/pith-number/SDNNLMMPWWK6HVLVACJMKQFYFX/graph.json","events_json":"https://pith.science/api/pith-number/SDNNLMMPWWK6HVLVACJMKQFYFX/events.json","paper":"https://pith.science/paper/SDNNLMMP"},"agent_actions":{"view_html":"https://pith.science/pith/SDNNLMMPWWK6HVLVACJMKQFYFX","download_json":"https://pith.science/pith/SDNNLMMPWWK6HVLVACJMKQFYFX.json","view_paper":"https://pith.science/paper/SDNNLMMP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.09695&json=true","fetch_graph":"https://pith.science/api/pith-number/SDNNLMMPWWK6HVLVACJMKQFYFX/graph.json","fetch_events":"https://pith.science/api/pith-number/SDNNLMMPWWK6HVLVACJMKQFYFX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SDNNLMMPWWK6HVLVACJMKQFYFX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SDNNLMMPWWK6HVLVACJMKQFYFX/action/storage_attestation","attest_author":"https://pith.science/pith/SDNNLMMPWWK6HVLVACJMKQFYFX/action/author_attestation","sign_citation":"https://pith.science/pith/SDNNLMMPWWK6HVLVACJMKQFYFX/action/citation_signature","submit_replication":"https://pith.science/pith/SDNNLMMPWWK6HVLVACJMKQFYFX/action/replication_record"}},"created_at":"2026-05-18T00:10:57.229111+00:00","updated_at":"2026-05-18T00:10:57.229111+00:00"}