{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:Y2776MCDZZAXHBRDX4LJSZKIBK","short_pith_number":"pith:Y2776MCD","schema_version":"1.0","canonical_sha256":"c6bfff3043ce41738623bf169965480a986efddc1f4a5156f7a03896bc7b4e42","source":{"kind":"arxiv","id":"1609.04439","version":3},"attestation_state":"computed","paper":{"title":"Unrestricted State Complexity of Binary Operations on Regular and Ideal Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Corwin Sinnamon, Janusz Brzozowski","submitted_at":"2016-09-14T20:39:47Z","abstract_excerpt":"We study the state complexity of binary operations on regular languages over different alphabets. It is known that if $L'_m$ and $L_n$ are languages of state complexities $m$ and $n$, respectively, and restricted to the same alphabet, the state complexity of any binary boolean operation on $L'_m$ and $L_n$ is $mn$, and that of product (concatenation) is $m 2^n - 2^{n-1}$. In contrast to this, we show that if $L'_m$ and $L_n$ are over different alphabets, the state complexity of union and symmetric difference is $(m+1)(n+1)$, that of difference is $mn+m$, that of intersection is $mn$, and that "},"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":"1609.04439","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-09-14T20:39:47Z","cross_cats_sorted":[],"title_canon_sha256":"ea2b54f0a87e397151d742035eaddb6c90cdd523c20501c1ab5c190c9ee155ec","abstract_canon_sha256":"d4b05a9f90c79203e3f9ecb79f4146312244d70d5cd450d865f3f2dccaf01369"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:31.668141Z","signature_b64":"Fr8KwaQ20FX8xJiqSbkTHE2zYm7afV73DuAykiBYjHPTqSE9p6O0QqEucvQCp/YAeDlvH5IPBO+5A6Q/giK/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6bfff3043ce41738623bf169965480a986efddc1f4a5156f7a03896bc7b4e42","last_reissued_at":"2026-05-18T00:27:31.667370Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:31.667370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unrestricted State Complexity of Binary Operations on Regular and Ideal Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Corwin Sinnamon, Janusz Brzozowski","submitted_at":"2016-09-14T20:39:47Z","abstract_excerpt":"We study the state complexity of binary operations on regular languages over different alphabets. It is known that if $L'_m$ and $L_n$ are languages of state complexities $m$ and $n$, respectively, and restricted to the same alphabet, the state complexity of any binary boolean operation on $L'_m$ and $L_n$ is $mn$, and that of product (concatenation) is $m 2^n - 2^{n-1}$. In contrast to this, we show that if $L'_m$ and $L_n$ are over different alphabets, the state complexity of union and symmetric difference is $(m+1)(n+1)$, that of difference is $mn+m$, that of intersection is $mn$, and that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.04439","kind":"arxiv","version":3},"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":"1609.04439","created_at":"2026-05-18T00:27:31.667503+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.04439v3","created_at":"2026-05-18T00:27:31.667503+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.04439","created_at":"2026-05-18T00:27:31.667503+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y2776MCDZZAX","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y2776MCDZZAXHBRD","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y2776MCD","created_at":"2026-05-18T12:30:51.357362+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/Y2776MCDZZAXHBRDX4LJSZKIBK","json":"https://pith.science/pith/Y2776MCDZZAXHBRDX4LJSZKIBK.json","graph_json":"https://pith.science/api/pith-number/Y2776MCDZZAXHBRDX4LJSZKIBK/graph.json","events_json":"https://pith.science/api/pith-number/Y2776MCDZZAXHBRDX4LJSZKIBK/events.json","paper":"https://pith.science/paper/Y2776MCD"},"agent_actions":{"view_html":"https://pith.science/pith/Y2776MCDZZAXHBRDX4LJSZKIBK","download_json":"https://pith.science/pith/Y2776MCDZZAXHBRDX4LJSZKIBK.json","view_paper":"https://pith.science/paper/Y2776MCD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.04439&json=true","fetch_graph":"https://pith.science/api/pith-number/Y2776MCDZZAXHBRDX4LJSZKIBK/graph.json","fetch_events":"https://pith.science/api/pith-number/Y2776MCDZZAXHBRDX4LJSZKIBK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y2776MCDZZAXHBRDX4LJSZKIBK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y2776MCDZZAXHBRDX4LJSZKIBK/action/storage_attestation","attest_author":"https://pith.science/pith/Y2776MCDZZAXHBRDX4LJSZKIBK/action/author_attestation","sign_citation":"https://pith.science/pith/Y2776MCDZZAXHBRDX4LJSZKIBK/action/citation_signature","submit_replication":"https://pith.science/pith/Y2776MCDZZAXHBRDX4LJSZKIBK/action/replication_record"}},"created_at":"2026-05-18T00:27:31.667503+00:00","updated_at":"2026-05-18T00:27:31.667503+00:00"}