12 citations · 39 across the 12 of their papers we have counts for
1 paper · 1 filter
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…