Extends Angluin-style tree automata learning with term rewriting systems for deductive inference, reducing query complexity for languages with known properties.
Small test suites for active automata learning
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Learning Tree Automata with Term Rewriting
Extends Angluin-style tree automata learning with term rewriting systems for deductive inference, reducing query complexity for languages with known properties.