Learning deterministic finite automata from smallest counterexamples
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Even linear simple matrix languages: formal language properties and grammatical inference
Theoretical Computer Science
Learning Multiplicity Automata from Smallest Counterexamples
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
Automatic symbolic compositional verification by learning assumptions
Formal Methods in System Design
Active learning of plans for safety and reachability goals with partial observability
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hi-index | 0.00 |