Learning tree languages from positive examples and membership queries
Theoretical Computer Science
MAT learners for recognizable tree languages and tree series
Acta Cybernetica
Characterizing membrane structures through multiset tree automata
WMC'07 Proceedings of the 8th international conference on Membrane computing
Malware analysis with tree automata inference
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Distributional learning of simple context-free tree grammars
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
Identifying p rules from membrane structures with an error-correcting approach
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Recognizing malicious software behaviors with tree automata inference
Formal Methods in System Design
| Hi-index | 0.00 |
In this paper, we study the notion of k-reversibility and k-testability when regular tree languages are involved. We present an inference algorithm for learning a k-testable tree language that runs in polynomial time with respect to the size of the sample used. We also study the tree language classes in relation to other well known ones, and some properties of these languages are proven.