{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PNM3IHRQ6DEWN5BXM4HOUHL5E7","short_pith_number":"pith:PNM3IHRQ","schema_version":"1.0","canonical_sha256":"7b59b41e30f0c966f437670eea1d7d27dcffad90ea705aefe79e72ad2b3852e4","source":{"kind":"arxiv","id":"1503.09163","version":2},"attestation_state":"computed","paper":{"title":"Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Gregor Kemper, Helmut Seidl, Sebastian Maneth","submitted_at":"2015-03-31T19:00:25Z","abstract_excerpt":"We show that equivalence of deterministic top-down tree-to-string transducers is decidable, thus solving a long standing open problem in formal language theory. We also present efficient algorithms for subclasses: polynomial time for total transducers with unary output alphabet (over a given top-down regular domain language), and co-randomized polynomial time for linear transducers; these results are obtained using techniques from multi-linear algebra.\n  For our main result, we prove that equivalence can be certified by means of inductive invariants using polynomial ideals. This allows us to c"},"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":"1503.09163","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-03-31T19:00:25Z","cross_cats_sorted":[],"title_canon_sha256":"21362e39ba71cd84be495acfb2c407cdb3ab7b0adcdf915a0f27adcdbf66ba2e","abstract_canon_sha256":"330c1b798d304b52433988ba8b913f4dd0b4597d1b13f0774c24a745aa078ceb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:02.352091Z","signature_b64":"X+J9vuN2XGXpDdYZQfteUjP3eUsCNgaAwsN62BOwLyLz9duzTT9NbVmYOoYj4WOLrjNBhkD/0GdCwgGgapazDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b59b41e30f0c966f437670eea1d7d27dcffad90ea705aefe79e72ad2b3852e4","last_reissued_at":"2026-05-18T00:52:02.351506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:02.351506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Gregor Kemper, Helmut Seidl, Sebastian Maneth","submitted_at":"2015-03-31T19:00:25Z","abstract_excerpt":"We show that equivalence of deterministic top-down tree-to-string transducers is decidable, thus solving a long standing open problem in formal language theory. We also present efficient algorithms for subclasses: polynomial time for total transducers with unary output alphabet (over a given top-down regular domain language), and co-randomized polynomial time for linear transducers; these results are obtained using techniques from multi-linear algebra.\n  For our main result, we prove that equivalence can be certified by means of inductive invariants using polynomial ideals. This allows us to c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.09163","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":"1503.09163","created_at":"2026-05-18T00:52:02.351593+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.09163v2","created_at":"2026-05-18T00:52:02.351593+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.09163","created_at":"2026-05-18T00:52:02.351593+00:00"},{"alias_kind":"pith_short_12","alias_value":"PNM3IHRQ6DEW","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PNM3IHRQ6DEWN5BX","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PNM3IHRQ","created_at":"2026-05-18T12:29:37.295048+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/PNM3IHRQ6DEWN5BXM4HOUHL5E7","json":"https://pith.science/pith/PNM3IHRQ6DEWN5BXM4HOUHL5E7.json","graph_json":"https://pith.science/api/pith-number/PNM3IHRQ6DEWN5BXM4HOUHL5E7/graph.json","events_json":"https://pith.science/api/pith-number/PNM3IHRQ6DEWN5BXM4HOUHL5E7/events.json","paper":"https://pith.science/paper/PNM3IHRQ"},"agent_actions":{"view_html":"https://pith.science/pith/PNM3IHRQ6DEWN5BXM4HOUHL5E7","download_json":"https://pith.science/pith/PNM3IHRQ6DEWN5BXM4HOUHL5E7.json","view_paper":"https://pith.science/paper/PNM3IHRQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.09163&json=true","fetch_graph":"https://pith.science/api/pith-number/PNM3IHRQ6DEWN5BXM4HOUHL5E7/graph.json","fetch_events":"https://pith.science/api/pith-number/PNM3IHRQ6DEWN5BXM4HOUHL5E7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PNM3IHRQ6DEWN5BXM4HOUHL5E7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PNM3IHRQ6DEWN5BXM4HOUHL5E7/action/storage_attestation","attest_author":"https://pith.science/pith/PNM3IHRQ6DEWN5BXM4HOUHL5E7/action/author_attestation","sign_citation":"https://pith.science/pith/PNM3IHRQ6DEWN5BXM4HOUHL5E7/action/citation_signature","submit_replication":"https://pith.science/pith/PNM3IHRQ6DEWN5BXM4HOUHL5E7/action/replication_record"}},"created_at":"2026-05-18T00:52:02.351593+00:00","updated_at":"2026-05-18T00:52:02.351593+00:00"}