ByNobleID
    On Computability, Learnability and Extractability of Finite State\n Machines from Recurrent Neural Networks | NobleID