Efficient Algorithms for the Inference of Minimum Size DFAs

摘要

This work describes algorithms for the inference of minimum size deterministic automata consistent with a labeled training set. The algorithms presented represent the state of the art for this problem, known to be computationally very hard.