{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OAUKKT5LNYX4FXYR3MH6BG5F5G","short_pith_number":"pith:OAUKKT5L","schema_version":"1.0","canonical_sha256":"7028a54fab6e2fc2df11db0fe09ba5e9843db622c2f78d259dc296e9a4621a9a","source":{"kind":"arxiv","id":"1504.05159","version":4},"attestation_state":"computed","paper":{"title":"Complexity of Suffix-Free Regular Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Janusz Brzozowski, Marek Szyku{\\l}a","submitted_at":"2015-04-20T19:09:34Z","abstract_excerpt":"We study various complexity properties of suffix-free regular languages. The quotient complexity of a regular language $L$ is the number of left quotients of $L$; this is the same as the state complexity of $L$. A regular language $L'$ is a dialect of a regular language $L$ if it differs only slightly from $L$. The quotient complexity of an operation on regular languages is the maximal quotient complexity of the result of the operation expressed as a function of the quotient complexities of the operands. A sequence $(L_k,L_{k+1},\\dots)$ of regular languages in some class ${\\mathcal C}$, where "},"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":"1504.05159","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-04-20T19:09:34Z","cross_cats_sorted":[],"title_canon_sha256":"919f81ea25dafe5c49a5f9e53149b82241060d74ad32913a14a950757402f167","abstract_canon_sha256":"50d6f8b322272f3d636005436a7be9e6580706f1b0720498b8848d23155db099"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:25.770190Z","signature_b64":"u5qEAZQmd7ZiUf7RLitsK/proimFM38p6cLXQEvS7yAQrGNcBAy7KH9+3NzQBjXYiAG991f3LQgjVSK29FU3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7028a54fab6e2fc2df11db0fe09ba5e9843db622c2f78d259dc296e9a4621a9a","last_reissued_at":"2026-05-18T00:55:25.769649Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:25.769649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of Suffix-Free Regular Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Janusz Brzozowski, Marek Szyku{\\l}a","submitted_at":"2015-04-20T19:09:34Z","abstract_excerpt":"We study various complexity properties of suffix-free regular languages. The quotient complexity of a regular language $L$ is the number of left quotients of $L$; this is the same as the state complexity of $L$. A regular language $L'$ is a dialect of a regular language $L$ if it differs only slightly from $L$. The quotient complexity of an operation on regular languages is the maximal quotient complexity of the result of the operation expressed as a function of the quotient complexities of the operands. A sequence $(L_k,L_{k+1},\\dots)$ of regular languages in some class ${\\mathcal C}$, where "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05159","kind":"arxiv","version":4},"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":"1504.05159","created_at":"2026-05-18T00:55:25.769744+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.05159v4","created_at":"2026-05-18T00:55:25.769744+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05159","created_at":"2026-05-18T00:55:25.769744+00:00"},{"alias_kind":"pith_short_12","alias_value":"OAUKKT5LNYX4","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OAUKKT5LNYX4FXYR","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OAUKKT5L","created_at":"2026-05-18T12:29:34.919912+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/OAUKKT5LNYX4FXYR3MH6BG5F5G","json":"https://pith.science/pith/OAUKKT5LNYX4FXYR3MH6BG5F5G.json","graph_json":"https://pith.science/api/pith-number/OAUKKT5LNYX4FXYR3MH6BG5F5G/graph.json","events_json":"https://pith.science/api/pith-number/OAUKKT5LNYX4FXYR3MH6BG5F5G/events.json","paper":"https://pith.science/paper/OAUKKT5L"},"agent_actions":{"view_html":"https://pith.science/pith/OAUKKT5LNYX4FXYR3MH6BG5F5G","download_json":"https://pith.science/pith/OAUKKT5LNYX4FXYR3MH6BG5F5G.json","view_paper":"https://pith.science/paper/OAUKKT5L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.05159&json=true","fetch_graph":"https://pith.science/api/pith-number/OAUKKT5LNYX4FXYR3MH6BG5F5G/graph.json","fetch_events":"https://pith.science/api/pith-number/OAUKKT5LNYX4FXYR3MH6BG5F5G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OAUKKT5LNYX4FXYR3MH6BG5F5G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OAUKKT5LNYX4FXYR3MH6BG5F5G/action/storage_attestation","attest_author":"https://pith.science/pith/OAUKKT5LNYX4FXYR3MH6BG5F5G/action/author_attestation","sign_citation":"https://pith.science/pith/OAUKKT5LNYX4FXYR3MH6BG5F5G/action/citation_signature","submit_replication":"https://pith.science/pith/OAUKKT5LNYX4FXYR3MH6BG5F5G/action/replication_record"}},"created_at":"2026-05-18T00:55:25.769744+00:00","updated_at":"2026-05-18T00:55:25.769744+00:00"}