Learning deterministic finite automata from smallest counterexamples
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A bibliographical study of grammatical inference
Pattern Recognition
On the learnability of shuffle ideals
ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
Hi-index | 0.04 |