Extending tree automaton learning with term rewriting systems enables deductive answers to some queries and reduces query complexity for languages with specified properties.
Learning regular sets from queries and counterexamples.Information and computation, 75(2):87– 106
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Learning Tree Automata with Term Rewriting
Extending tree automaton learning with term rewriting systems enables deductive answers to some queries and reduces query complexity for languages with specified properties.