randomly generated languages using sparse example sets. … This paper provides a survey
of work conducted on inferring a class of randomly generated DFA (Deterministic Finite
State Automata) from sparsely labeled example strings. Since the introduction of this class
of problems to the grammar induction community, a number of solutions have been
proposed. Our paper is the first comprehensive and comparative …