An L# Based Algorithm for Active Learning of Minimal Separating Automata

Abstract A DFA separates two disjoint languages $L_1$ L 1 and $L_2$ L 2 if it accepts every word in $L_1$ L 1 and rejects every word in $L_2$ L 2 . Algorithms for active learning of small separating DFAs have many applications, e.g. for learning network invariants, learning contextual assumptions in compositional verification, learning state machines from large amounts of log data, and learning bug pattern descriptions. We propose a simple active learning algorithm, inspired by $L^{\#}$ L # , that learns a minimal separating DFA for disjoint languages $L_1$ L 1 and $L_2$ L 2 if one exists. Experiments show that our algorithm significantly outperforms existing active learning algorithms on both randomly generated and industrial benchmarks.