{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:HYPJQBW6TUDGS4VCKQWZSM6IKI","short_pith_number":"pith:HYPJQBW6","schema_version":"1.0","canonical_sha256":"3e1e9806de9d066972a2542d9933c8523f45884a7c5aac504b7e05aa0fbb309d","source":{"kind":"arxiv","id":"1010.3263","version":1},"attestation_state":"computed","paper":{"title":"Syntactic Complexity of Ideal and Closed Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Janusz Brzozowski, Yuli Ye","submitted_at":"2010-10-15T20:06:43Z","abstract_excerpt":"The state complexity of a regular language is the number of states in the minimal deterministic automaton accepting the language. The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of regular languages is the worst-case syntactic complexity taken as a function of the state complexity $n$ of languages in that class. We study the syntactic complexity of the class of regular ideal languages and their complements, the closed languages. We prove that $n^{n-1}$ is a tight upper bound on the complexity of right ideals a"},"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":"1010.3263","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-10-15T20:06:43Z","cross_cats_sorted":[],"title_canon_sha256":"e38afd948b13cf8651d1e3a41f398a48d0333d02f1a851e8778a077906f4ba86","abstract_canon_sha256":"2e33d6f304dbad089482b09b2f31518a1fc41edb2ae9b1a16466a81846b18584"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:09.701753Z","signature_b64":"sHKfrlKvZrBUteqsqoHyyoyaQD+4PhENgw2D/I3LiDJxQ1rsJnfDnNIhppP11P7VmpiqHCvsT/ehxn5EeUMxCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e1e9806de9d066972a2542d9933c8523f45884a7c5aac504b7e05aa0fbb309d","last_reissued_at":"2026-05-18T04:39:09.701172Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:09.701172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Syntactic Complexity of Ideal and Closed Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Janusz Brzozowski, Yuli Ye","submitted_at":"2010-10-15T20:06:43Z","abstract_excerpt":"The state complexity of a regular language is the number of states in the minimal deterministic automaton accepting the language. The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of regular languages is the worst-case syntactic complexity taken as a function of the state complexity $n$ of languages in that class. We study the syntactic complexity of the class of regular ideal languages and their complements, the closed languages. We prove that $n^{n-1}$ is a tight upper bound on the complexity of right ideals a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.3263","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":"1010.3263","created_at":"2026-05-18T04:39:09.701263+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.3263v1","created_at":"2026-05-18T04:39:09.701263+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.3263","created_at":"2026-05-18T04:39:09.701263+00:00"},{"alias_kind":"pith_short_12","alias_value":"HYPJQBW6TUDG","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"HYPJQBW6TUDGS4VC","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"HYPJQBW6","created_at":"2026-05-18T12:26:07.630475+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/HYPJQBW6TUDGS4VCKQWZSM6IKI","json":"https://pith.science/pith/HYPJQBW6TUDGS4VCKQWZSM6IKI.json","graph_json":"https://pith.science/api/pith-number/HYPJQBW6TUDGS4VCKQWZSM6IKI/graph.json","events_json":"https://pith.science/api/pith-number/HYPJQBW6TUDGS4VCKQWZSM6IKI/events.json","paper":"https://pith.science/paper/HYPJQBW6"},"agent_actions":{"view_html":"https://pith.science/pith/HYPJQBW6TUDGS4VCKQWZSM6IKI","download_json":"https://pith.science/pith/HYPJQBW6TUDGS4VCKQWZSM6IKI.json","view_paper":"https://pith.science/paper/HYPJQBW6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.3263&json=true","fetch_graph":"https://pith.science/api/pith-number/HYPJQBW6TUDGS4VCKQWZSM6IKI/graph.json","fetch_events":"https://pith.science/api/pith-number/HYPJQBW6TUDGS4VCKQWZSM6IKI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HYPJQBW6TUDGS4VCKQWZSM6IKI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HYPJQBW6TUDGS4VCKQWZSM6IKI/action/storage_attestation","attest_author":"https://pith.science/pith/HYPJQBW6TUDGS4VCKQWZSM6IKI/action/author_attestation","sign_citation":"https://pith.science/pith/HYPJQBW6TUDGS4VCKQWZSM6IKI/action/citation_signature","submit_replication":"https://pith.science/pith/HYPJQBW6TUDGS4VCKQWZSM6IKI/action/replication_record"}},"created_at":"2026-05-18T04:39:09.701263+00:00","updated_at":"2026-05-18T04:39:09.701263+00:00"}