{"paper":{"title":"Learning Tree Automata with Term Rewriting","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Supplying a term rewriting system allows the learning algorithm to deduce answers to some queries and thereby reduce the total number required to identify a tree automaton.","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Jakub Kopystia\\'nski, Jan Otop","submitted_at":"2026-05-08T13:15:59Z","abstract_excerpt":"We present an extension of the Angluin-style learning algorithm for tree automata that incorporates deductive inference. The learning algorithm is provided with a term rewriting system that specifies properties of the target tree language (e.g., the order of subtrees under a symbol f is irrelevant). This term rewriting system is used to infer answers to some queries, which reduces the query complexity of the learning algorithm. We present examples of rewrite systems that express natural properties of tree-structured data, which yield a significant reduction in the number of queries."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We present an extension of the Angluin-style learning algorithm for tree automata that incorporates deductive inference. The learning algorithm is provided with a term rewriting system that specifies properties of the target tree language. This term rewriting system is used to infer answers to some queries, which reduces the query complexity of the learning algorithm.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The supplied term rewriting system is assumed to be sound, complete, and consistent with the target language so that all deductive inferences drawn from it are correct and do not miss relevant equivalences.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Extending tree automaton learning with term rewriting systems enables deductive answers to some queries and reduces query complexity for languages with specified properties.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Supplying a term rewriting system allows the learning algorithm to deduce answers to some queries and thereby reduce the total number required to identify a tree automaton.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"a8f08fa433e5e859e08678a6667d5562aa7678af7de1fe334749208cfe088628"},"source":{"id":"2605.07710","kind":"arxiv","version":2},"verdict":{"id":"6e8243c5-00e5-4b5c-83de-aec1761802be","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-11T02:28:20.928349Z","strongest_claim":"We present an extension of the Angluin-style learning algorithm for tree automata that incorporates deductive inference. The learning algorithm is provided with a term rewriting system that specifies properties of the target tree language. This term rewriting system is used to infer answers to some queries, which reduces the query complexity of the learning algorithm.","one_line_summary":"Extending tree automaton learning with term rewriting systems enables deductive answers to some queries and reduces query complexity for languages with specified properties.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The supplied term rewriting system is assumed to be sound, complete, and consistent with the target language so that all deductive inferences drawn from it are correct and do not miss relevant equivalences.","pith_extraction_headline":"Supplying a term rewriting system allows the learning algorithm to deduce answers to some queries and thereby reduce the total number required to identify a tree automaton."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.07710/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-20T10:22:02.833202Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-20T05:36:06.551661Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T16:01:18.536523Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T11:35:57.038791Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"67a57da44decf95ecb4fedb399886e9b3da53d92ec96908ccb34c8f1a22da9fe"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"27b3b4b9a01831051957460cc133b40723841efc93ee72807ba5800873dcbd9c"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}