{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UELZ4PWAXB4DIPGVPF6SBL36OL","short_pith_number":"pith:UELZ4PWA","schema_version":"1.0","canonical_sha256":"a1179e3ec0b878343cd5797d20af7e72d21fd35a7480154c661358a88970a64a","source":{"kind":"arxiv","id":"1907.09362","version":1},"attestation_state":"computed","paper":{"title":"Two-way Parikh Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Emmanuel Filiot, Nicolas Mazzocchi, Shibashis Guha","submitted_at":"2019-07-22T15:03:33Z","abstract_excerpt":"Parikh automata extend automata with counters whose values can only be tested at the end of the computation, with respect to membership into a semi-linear set. Parikh automata have found several applications, for instance in transducer theory, as they enjoy decidable emptiness problem. In this paper, we study two-way Parikh automata. We show that emptiness becomes undecidable in the non-deterministic case. However, it is PSpace-C when the number of visits to any input position is bounded and the semi-linear set is given as an existential Presburger formula. We also give tight complexity bounds"},"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":"1907.09362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-07-22T15:03:33Z","cross_cats_sorted":[],"title_canon_sha256":"956322d0f8784c9ba006cb11194880cb67bd4a3339cb3eb6d43dd57a5f2ebfb2","abstract_canon_sha256":"9aaa4b42261c991e3aabf7515bc20a61c4000aa6d2ba5cfcd494000878ba9a4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:59.399354Z","signature_b64":"R3WV/JnFheZV07gnfRP5n2F0bFuMsRFj2L0X+bOJz2Ca940jt45Q2+rJidsJ0sgsDaam+37KGg9qDsV8hAOdCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1179e3ec0b878343cd5797d20af7e72d21fd35a7480154c661358a88970a64a","last_reissued_at":"2026-05-17T23:39:59.398943Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:59.398943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-way Parikh Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Emmanuel Filiot, Nicolas Mazzocchi, Shibashis Guha","submitted_at":"2019-07-22T15:03:33Z","abstract_excerpt":"Parikh automata extend automata with counters whose values can only be tested at the end of the computation, with respect to membership into a semi-linear set. Parikh automata have found several applications, for instance in transducer theory, as they enjoy decidable emptiness problem. In this paper, we study two-way Parikh automata. We show that emptiness becomes undecidable in the non-deterministic case. However, it is PSpace-C when the number of visits to any input position is bounded and the semi-linear set is given as an existential Presburger formula. We also give tight complexity bounds"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09362","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":"1907.09362","created_at":"2026-05-17T23:39:59.399002+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.09362v1","created_at":"2026-05-17T23:39:59.399002+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09362","created_at":"2026-05-17T23:39:59.399002+00:00"},{"alias_kind":"pith_short_12","alias_value":"UELZ4PWAXB4D","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"UELZ4PWAXB4DIPGV","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"UELZ4PWA","created_at":"2026-05-18T12:33:30.264802+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/UELZ4PWAXB4DIPGVPF6SBL36OL","json":"https://pith.science/pith/UELZ4PWAXB4DIPGVPF6SBL36OL.json","graph_json":"https://pith.science/api/pith-number/UELZ4PWAXB4DIPGVPF6SBL36OL/graph.json","events_json":"https://pith.science/api/pith-number/UELZ4PWAXB4DIPGVPF6SBL36OL/events.json","paper":"https://pith.science/paper/UELZ4PWA"},"agent_actions":{"view_html":"https://pith.science/pith/UELZ4PWAXB4DIPGVPF6SBL36OL","download_json":"https://pith.science/pith/UELZ4PWAXB4DIPGVPF6SBL36OL.json","view_paper":"https://pith.science/paper/UELZ4PWA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.09362&json=true","fetch_graph":"https://pith.science/api/pith-number/UELZ4PWAXB4DIPGVPF6SBL36OL/graph.json","fetch_events":"https://pith.science/api/pith-number/UELZ4PWAXB4DIPGVPF6SBL36OL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UELZ4PWAXB4DIPGVPF6SBL36OL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UELZ4PWAXB4DIPGVPF6SBL36OL/action/storage_attestation","attest_author":"https://pith.science/pith/UELZ4PWAXB4DIPGVPF6SBL36OL/action/author_attestation","sign_citation":"https://pith.science/pith/UELZ4PWAXB4DIPGVPF6SBL36OL/action/citation_signature","submit_replication":"https://pith.science/pith/UELZ4PWAXB4DIPGVPF6SBL36OL/action/replication_record"}},"created_at":"2026-05-17T23:39:59.399002+00:00","updated_at":"2026-05-17T23:39:59.399002+00:00"}