1 paper
Jaouhar Slimi, Tristan Le Gall, Augustin Lemesle
We present a passive automata learning algorithm that can extract automata from recurrent networks with very large or even infinite alphabets. Our method combines overapproximation…