9 citations · 14 across the 3 of their papers we have counts for
3 papers
cs.LG2017★ 3 cited
Learning Pairwise Disjoint Simple Languages from Positive Examples
Alexis Linard, Rick Smetsers, Frits Vaandrager +3
A classical problem in grammatical inference is to identify a deterministic finite automaton (DFA) from a set of positive and negative examples. In this paper, we address the relat…
cs.FL2017★ 2 cited
Grammatical Inference as a Satisfiability Modulo Theories Problem
Rick Smetsers
The problem of learning a minimal consistent model from a set of labeled sequences of symbols is addressed from a satisfiability modulo theories perspective. We present two encodin…
cs.SE2016★ 9 cited
Complementing Model Learning with Mutation-Based Fuzzing
Rick Smetsers, Joshua Moerman, Mark Janssen +1
An ongoing challenge for learning algorithms formulated in the Minimally Adequate Teacher framework is to efficiently obtain counterexamples. In this paper we compare and combine c…