Extending tree automaton learning with term rewriting systems enables deductive answers to some queries and reduces query complexity for languages with specified properties.
Learning tree automata with term rewriting
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.