{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:TEHZTIMZC3NRNMNDWMUPASGQC4","short_pith_number":"pith:TEHZTIMZ","schema_version":"1.0","canonical_sha256":"990f99a19916db16b1a3b328f048d017177aa6e7262e982bc7bc752fb162bad5","source":{"kind":"arxiv","id":"1304.0733","version":2},"attestation_state":"computed","paper":{"title":"On the State Complexity of the Reverse of R- and J-trivial Regular Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Galina Jir\\'askov\\'a, Tom\\'a\\v{s} Masopust","submitted_at":"2013-04-02T18:42:05Z","abstract_excerpt":"The tight upper bound on the state complexity of the reverse of R-trivial and J-trivial regular languages of the state complexity n is 2^{n-1}. The witness is ternary for R-trivial regular languages and (n-1)-ary for J-trivial regular languages. In this paper, we prove that the bound can be met neither by a binary R-trivial regular language nor by a J-trivial regular language over an (n-2)-element alphabet. We provide a characterization of tight bounds for R-trivial regular languages depending on the state complexity of the language and the size of its alphabet. We show the tight bound for J-t"},"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":"1304.0733","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-04-02T18:42:05Z","cross_cats_sorted":[],"title_canon_sha256":"fc328e727de7b168a03444afba557121579895a95d2fd2584983f7171cd51234","abstract_canon_sha256":"f8a8e7a988fe9e2e22838c8c298ac9425b41fbf868ee92a9da5fdce4b4d18692"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:23.456641Z","signature_b64":"VhTKD3NRVxFw/836NKzdUNmEErrZehAqDGSmGzf98kMNoQ2VNOI9K/VWy5QntkUFuhqCQtE4Uiy3iwAxCgDxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"990f99a19916db16b1a3b328f048d017177aa6e7262e982bc7bc752fb162bad5","last_reissued_at":"2026-05-18T03:21:23.456114Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:23.456114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the State Complexity of the Reverse of R- and J-trivial Regular Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Galina Jir\\'askov\\'a, Tom\\'a\\v{s} Masopust","submitted_at":"2013-04-02T18:42:05Z","abstract_excerpt":"The tight upper bound on the state complexity of the reverse of R-trivial and J-trivial regular languages of the state complexity n is 2^{n-1}. The witness is ternary for R-trivial regular languages and (n-1)-ary for J-trivial regular languages. In this paper, we prove that the bound can be met neither by a binary R-trivial regular language nor by a J-trivial regular language over an (n-2)-element alphabet. We provide a characterization of tight bounds for R-trivial regular languages depending on the state complexity of the language and the size of its alphabet. We show the tight bound for J-t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0733","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":"1304.0733","created_at":"2026-05-18T03:21:23.456185+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.0733v2","created_at":"2026-05-18T03:21:23.456185+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0733","created_at":"2026-05-18T03:21:23.456185+00:00"},{"alias_kind":"pith_short_12","alias_value":"TEHZTIMZC3NR","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"TEHZTIMZC3NRNMND","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"TEHZTIMZ","created_at":"2026-05-18T12:28:02.375192+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/TEHZTIMZC3NRNMNDWMUPASGQC4","json":"https://pith.science/pith/TEHZTIMZC3NRNMNDWMUPASGQC4.json","graph_json":"https://pith.science/api/pith-number/TEHZTIMZC3NRNMNDWMUPASGQC4/graph.json","events_json":"https://pith.science/api/pith-number/TEHZTIMZC3NRNMNDWMUPASGQC4/events.json","paper":"https://pith.science/paper/TEHZTIMZ"},"agent_actions":{"view_html":"https://pith.science/pith/TEHZTIMZC3NRNMNDWMUPASGQC4","download_json":"https://pith.science/pith/TEHZTIMZC3NRNMNDWMUPASGQC4.json","view_paper":"https://pith.science/paper/TEHZTIMZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.0733&json=true","fetch_graph":"https://pith.science/api/pith-number/TEHZTIMZC3NRNMNDWMUPASGQC4/graph.json","fetch_events":"https://pith.science/api/pith-number/TEHZTIMZC3NRNMNDWMUPASGQC4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TEHZTIMZC3NRNMNDWMUPASGQC4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TEHZTIMZC3NRNMNDWMUPASGQC4/action/storage_attestation","attest_author":"https://pith.science/pith/TEHZTIMZC3NRNMNDWMUPASGQC4/action/author_attestation","sign_citation":"https://pith.science/pith/TEHZTIMZC3NRNMNDWMUPASGQC4/action/citation_signature","submit_replication":"https://pith.science/pith/TEHZTIMZC3NRNMNDWMUPASGQC4/action/replication_record"}},"created_at":"2026-05-18T03:21:23.456185+00:00","updated_at":"2026-05-18T03:21:23.456185+00:00"}