{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EZQIPUCAKFS2FGUY4CXVIPLVE4","short_pith_number":"pith:EZQIPUCA","schema_version":"1.0","canonical_sha256":"266087d0405165a29a98e0af543d752724916a6b70cc2acac41c88c6afa9ab1d","source":{"kind":"arxiv","id":"1412.2281","version":2},"attestation_state":"computed","paper":{"title":"Syntactic Complexity of Suffix-Free 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":"2014-12-06T20:58:05Z","abstract_excerpt":"We solve an open problem concerning syntactic complexity: We prove that the cardinality of the syntactic semigroup of a suffix-free language with $n$ left quotients (that is, with state complexity $n$) is at most $(n-1)^{n-2}+n-2$ for $n\\ge 6$. Since this bound is known to be reachable, this settles the problem. We also reduce the alphabet of the witness languages reaching this bound to five letters instead of $n+2$, and show that it cannot be any smaller. Finally, we prove that the transition semigroup of a minimal deterministic automaton accepting a witness language is unique for each $n$."},"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":"1412.2281","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-12-06T20:58:05Z","cross_cats_sorted":[],"title_canon_sha256":"e09dde8553e0342711a2c1414d34d609753b8480289f3431e46844b00478baa0","abstract_canon_sha256":"8f31d7c6a324f62d2d98d58ff626f37bf1d29c7488bfe74b78a90b323cb54485"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:08.232345Z","signature_b64":"0dy2fpv+AijR2FZ3c+i0IXNMdCVf8zY/QXlmAUWTwqXRJUUdWrL+76B+9iMWeXjlGEC0C9TwUTo2+mMLkzT8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"266087d0405165a29a98e0af543d752724916a6b70cc2acac41c88c6afa9ab1d","last_reissued_at":"2026-05-18T01:30:08.231810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:08.231810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Syntactic Complexity of Suffix-Free 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":"2014-12-06T20:58:05Z","abstract_excerpt":"We solve an open problem concerning syntactic complexity: We prove that the cardinality of the syntactic semigroup of a suffix-free language with $n$ left quotients (that is, with state complexity $n$) is at most $(n-1)^{n-2}+n-2$ for $n\\ge 6$. Since this bound is known to be reachable, this settles the problem. We also reduce the alphabet of the witness languages reaching this bound to five letters instead of $n+2$, and show that it cannot be any smaller. Finally, we prove that the transition semigroup of a minimal deterministic automaton accepting a witness language is unique for each $n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2281","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":"1412.2281","created_at":"2026-05-18T01:30:08.231881+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.2281v2","created_at":"2026-05-18T01:30:08.231881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2281","created_at":"2026-05-18T01:30:08.231881+00:00"},{"alias_kind":"pith_short_12","alias_value":"EZQIPUCAKFS2","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"EZQIPUCAKFS2FGUY","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"EZQIPUCA","created_at":"2026-05-18T12:28:28.263976+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/EZQIPUCAKFS2FGUY4CXVIPLVE4","json":"https://pith.science/pith/EZQIPUCAKFS2FGUY4CXVIPLVE4.json","graph_json":"https://pith.science/api/pith-number/EZQIPUCAKFS2FGUY4CXVIPLVE4/graph.json","events_json":"https://pith.science/api/pith-number/EZQIPUCAKFS2FGUY4CXVIPLVE4/events.json","paper":"https://pith.science/paper/EZQIPUCA"},"agent_actions":{"view_html":"https://pith.science/pith/EZQIPUCAKFS2FGUY4CXVIPLVE4","download_json":"https://pith.science/pith/EZQIPUCAKFS2FGUY4CXVIPLVE4.json","view_paper":"https://pith.science/paper/EZQIPUCA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.2281&json=true","fetch_graph":"https://pith.science/api/pith-number/EZQIPUCAKFS2FGUY4CXVIPLVE4/graph.json","fetch_events":"https://pith.science/api/pith-number/EZQIPUCAKFS2FGUY4CXVIPLVE4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EZQIPUCAKFS2FGUY4CXVIPLVE4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EZQIPUCAKFS2FGUY4CXVIPLVE4/action/storage_attestation","attest_author":"https://pith.science/pith/EZQIPUCAKFS2FGUY4CXVIPLVE4/action/author_attestation","sign_citation":"https://pith.science/pith/EZQIPUCAKFS2FGUY4CXVIPLVE4/action/citation_signature","submit_replication":"https://pith.science/pith/EZQIPUCAKFS2FGUY4CXVIPLVE4/action/replication_record"}},"created_at":"2026-05-18T01:30:08.231881+00:00","updated_at":"2026-05-18T01:30:08.231881+00:00"}