1

Learning Deterministic Finite Automata Decompositions from Examples and Demonstrations
Learning Differentiable Programs with Admissible Neural Heuristics
Representing Formal Languages: A Comparison Between Finite Automata and Recurrent Neural Networks