Representing Formal Languages: A Comparison Between Finite Automata and
Recurrent Neural Networks

Representing Formal Languages: A Comparison Between Finite Automata and Recurrent Neural Networks

27 February 2019

Joshua J. Michalenko

Richard G. Baraniuk

Swarat Chaudhuri

Papers citing "Representing Formal Languages: A Comparison Between Finite Automata and Recurrent Neural Networks"

5 / 5 papers shown

Title
Explaining Black Boxes on Sequential Data using Weighted Automata Stéphane Ayache Rémi Eyraud Noé Goudian 43 43 0 12 Oct 2018
Connecting Weighted Automata and Recurrent Neural Networks through Spectral Learning Guillaume Rabusseau Tianyu Li Doina Precup 115 41 0 04 Jul 2018
Extracting Automata from Recurrent Neural Networks Using Queries and Counterexamples Gail Weiss Yoav Goldberg Eran Yahav 36 186 0 27 Nov 2017
Increasing the Interpretability of Recurrent Neural Networks Using Hidden Markov Models Viktoriya Krakovna Finale Doshi-Velez AI4CE 122 69 0 16 Jun 2016
Visualizing and Understanding Recurrent Networks A. Karpathy Justin Johnson Li Fei-Fei HAI 118 1,101 0 05 Jun 2015

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.