Learning minimal automata with recurrent neural networks

In this article, we present a novel approach to learning finite automata with the help of recurrent neural networks. Our goal
is not only to train a neural network that predicts the observable behavior of an automaton but also to learn its structure,
including the set of states and transitions. In contrast to previous work, we constrain the training with a specific regularization
term.We iteratively adapt the architecture to learn the minimal automaton, in the case where the number of states is unknown.
We evaluate our approach with standard examples from the automata learning literature, but also include a case study of
learning the finite-state models of real Bluetooth Low Energy protocol implementations. The results show that we can find
an appropriate architecture to learn the correct minimal automata in all considered cases.