{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BMFYNPXCJFKF44NT5MTT34BHQD","short_pith_number":"pith:BMFYNPXC","schema_version":"1.0","canonical_sha256":"0b0b86bee249545e71b3eb273df02780c2d54d71ad9bb4789c2a80fc4d9d4790","source":{"kind":"arxiv","id":"1705.07150","version":2},"attestation_state":"computed","paper":{"title":"State Complexity of Reversals of Deterministic Finite Automata with Output","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Sylvie Davies","submitted_at":"2017-05-19T19:10:25Z","abstract_excerpt":"We investigate the worst-case state complexity of reversals of deterministic finite automata with output (DFAOs). In these automata, each state is assigned some output value, rather than simply being labelled final or non-final. This directly generalizes the well-studied problem of determining the worst-case state complexity of reversals of ordinary deterministic finite automata. If a DFAO has $n$ states and $k$ possible output values, there is a known upper bound of $k^n$ for the state complexity of reversal. We show this bound can be reached with a ternary input alphabet. We conjecture it ca"},"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":"1705.07150","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-05-19T19:10:25Z","cross_cats_sorted":[],"title_canon_sha256":"ef391d6d4cb12d4e3b691e15d2e679de6e3f7ab006edaa2a8c913fac801b0812","abstract_canon_sha256":"2ba22e6ef7ecc328c37f0145e718a7d05e18a9d5c61bc3f8f0c2fdad9eabfb17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:36.217103Z","signature_b64":"dQrJSdCLriNEs+63DweMe9qh8L0H80IK/J2RZqi8TYq2IJ9bYc4kIKCMDMDHdHXOMaXDq+u1Ip5BSrzOVWiWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b0b86bee249545e71b3eb273df02780c2d54d71ad9bb4789c2a80fc4d9d4790","last_reissued_at":"2026-05-18T00:32:36.216405Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:36.216405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"State Complexity of Reversals of Deterministic Finite Automata with Output","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Sylvie Davies","submitted_at":"2017-05-19T19:10:25Z","abstract_excerpt":"We investigate the worst-case state complexity of reversals of deterministic finite automata with output (DFAOs). In these automata, each state is assigned some output value, rather than simply being labelled final or non-final. This directly generalizes the well-studied problem of determining the worst-case state complexity of reversals of ordinary deterministic finite automata. If a DFAO has $n$ states and $k$ possible output values, there is a known upper bound of $k^n$ for the state complexity of reversal. We show this bound can be reached with a ternary input alphabet. We conjecture it ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07150","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":"1705.07150","created_at":"2026-05-18T00:32:36.216512+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.07150v2","created_at":"2026-05-18T00:32:36.216512+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07150","created_at":"2026-05-18T00:32:36.216512+00:00"},{"alias_kind":"pith_short_12","alias_value":"BMFYNPXCJFKF","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BMFYNPXCJFKF44NT","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BMFYNPXC","created_at":"2026-05-18T12:31:08.081275+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/BMFYNPXCJFKF44NT5MTT34BHQD","json":"https://pith.science/pith/BMFYNPXCJFKF44NT5MTT34BHQD.json","graph_json":"https://pith.science/api/pith-number/BMFYNPXCJFKF44NT5MTT34BHQD/graph.json","events_json":"https://pith.science/api/pith-number/BMFYNPXCJFKF44NT5MTT34BHQD/events.json","paper":"https://pith.science/paper/BMFYNPXC"},"agent_actions":{"view_html":"https://pith.science/pith/BMFYNPXCJFKF44NT5MTT34BHQD","download_json":"https://pith.science/pith/BMFYNPXCJFKF44NT5MTT34BHQD.json","view_paper":"https://pith.science/paper/BMFYNPXC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.07150&json=true","fetch_graph":"https://pith.science/api/pith-number/BMFYNPXCJFKF44NT5MTT34BHQD/graph.json","fetch_events":"https://pith.science/api/pith-number/BMFYNPXCJFKF44NT5MTT34BHQD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BMFYNPXCJFKF44NT5MTT34BHQD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BMFYNPXCJFKF44NT5MTT34BHQD/action/storage_attestation","attest_author":"https://pith.science/pith/BMFYNPXCJFKF44NT5MTT34BHQD/action/author_attestation","sign_citation":"https://pith.science/pith/BMFYNPXCJFKF44NT5MTT34BHQD/action/citation_signature","submit_replication":"https://pith.science/pith/BMFYNPXCJFKF44NT5MTT34BHQD/action/replication_record"}},"created_at":"2026-05-18T00:32:36.216512+00:00","updated_at":"2026-05-18T00:32:36.216512+00:00"}