Learning Tree Automata with Term Rewriting
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913156302897152 |
|---|---|
| author | Kopystiański, Jakub Otop, Jan |
| author_facet | Kopystiański, Jakub Otop, Jan |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_07710 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Learning Tree Automata with Term Rewriting Kopystiański, Jakub Otop, Jan Formal Languages and Automata Theory F.1.1; I.2.2 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. |
| title | Learning Tree Automata with Term Rewriting |
| topic | Formal Languages and Automata Theory F.1.1; I.2.2 |
| url | https://arxiv.org/abs/2605.07710 |