{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:RLICFDDUOLKA5DH2NRNAKL7XAY","short_pith_number":"pith:RLICFDDU","schema_version":"1.0","canonical_sha256":"8ad0228c7472d40e8cfa6c5a052ff7061f54c2e1864436e04f8206e066ebc8df","source":{"kind":"arxiv","id":"1212.1346","version":2},"attestation_state":"computed","paper":{"title":"Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent One-Way and Two-Way Deterministic Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki","submitted_at":"2012-12-06T15:15:17Z","abstract_excerpt":"We investigate the conversion of one-way nondeterministic finite automata and context-free grammars into Parikh equivalent one-way and two-way deterministic finite automata, from a descriptional complexity point of view.\n  We prove that for each one-way nondeterministic automaton with $n$ states there exist Parikh equivalent one-way and two-way deterministic automata with $e^{O(\\sqrt{n \\ln n})}$ and $p(n)$ states, respectively, where $p(n)$ is a polynomial. Furthermore, these costs are tight. In contrast, if all the words accepted by the given automaton contain at least two different letters, "},"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":"1212.1346","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-12-06T15:15:17Z","cross_cats_sorted":[],"title_canon_sha256":"f57c98433c03a9aaeeceae75524c9523709fc4de978e42009997450be7339bfb","abstract_canon_sha256":"7116e57baf53597beca4f162fbbfbdd239810d253ceeb5c005019aca907e4524"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:45.717800Z","signature_b64":"NHLIu33fRfm+6xmY2U4ib97uc3jAX1cL9MX/JoOryaV1nESWGDxasQdTaQwJ4MfA3+F2EZU5KGcr8Cj3BOGAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ad0228c7472d40e8cfa6c5a052ff7061f54c2e1864436e04f8206e066ebc8df","last_reissued_at":"2026-05-18T03:38:45.717098Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:45.717098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent One-Way and Two-Way Deterministic Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki","submitted_at":"2012-12-06T15:15:17Z","abstract_excerpt":"We investigate the conversion of one-way nondeterministic finite automata and context-free grammars into Parikh equivalent one-way and two-way deterministic finite automata, from a descriptional complexity point of view.\n  We prove that for each one-way nondeterministic automaton with $n$ states there exist Parikh equivalent one-way and two-way deterministic automata with $e^{O(\\sqrt{n \\ln n})}$ and $p(n)$ states, respectively, where $p(n)$ is a polynomial. Furthermore, these costs are tight. In contrast, if all the words accepted by the given automaton contain at least two different letters, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1346","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":"1212.1346","created_at":"2026-05-18T03:38:45.717208+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.1346v2","created_at":"2026-05-18T03:38:45.717208+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1346","created_at":"2026-05-18T03:38:45.717208+00:00"},{"alias_kind":"pith_short_12","alias_value":"RLICFDDUOLKA","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"RLICFDDUOLKA5DH2","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"RLICFDDU","created_at":"2026-05-18T12:27:20.899486+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/RLICFDDUOLKA5DH2NRNAKL7XAY","json":"https://pith.science/pith/RLICFDDUOLKA5DH2NRNAKL7XAY.json","graph_json":"https://pith.science/api/pith-number/RLICFDDUOLKA5DH2NRNAKL7XAY/graph.json","events_json":"https://pith.science/api/pith-number/RLICFDDUOLKA5DH2NRNAKL7XAY/events.json","paper":"https://pith.science/paper/RLICFDDU"},"agent_actions":{"view_html":"https://pith.science/pith/RLICFDDUOLKA5DH2NRNAKL7XAY","download_json":"https://pith.science/pith/RLICFDDUOLKA5DH2NRNAKL7XAY.json","view_paper":"https://pith.science/paper/RLICFDDU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.1346&json=true","fetch_graph":"https://pith.science/api/pith-number/RLICFDDUOLKA5DH2NRNAKL7XAY/graph.json","fetch_events":"https://pith.science/api/pith-number/RLICFDDUOLKA5DH2NRNAKL7XAY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RLICFDDUOLKA5DH2NRNAKL7XAY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RLICFDDUOLKA5DH2NRNAKL7XAY/action/storage_attestation","attest_author":"https://pith.science/pith/RLICFDDUOLKA5DH2NRNAKL7XAY/action/author_attestation","sign_citation":"https://pith.science/pith/RLICFDDUOLKA5DH2NRNAKL7XAY/action/citation_signature","submit_replication":"https://pith.science/pith/RLICFDDUOLKA5DH2NRNAKL7XAY/action/replication_record"}},"created_at":"2026-05-18T03:38:45.717208+00:00","updated_at":"2026-05-18T03:38:45.717208+00:00"}