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

ArXiv (abs)PDF HTML

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

6 / 6 papers shown

Title
On the Relationship Between RNN Hidden State Vectors and Semantic Ground Truth Edi Muškardin Martin Tappler Ingo Pill B. Aichernig Thomas Pock 31 0 0 29 Jun 2023
Can deep neural networks learn process model structure? An assessment framework and analysis Jari Peeperkorn S. vanden Broucke Jochen De Weerdt 45 7 0 24 Feb 2022
Understanding Robust Generalization in Learning Regular Languages Soham Dan Osbert Bastani Dan Roth OOD 54 4 0 20 Feb 2022
Integrating Regular Expressions with Neural Networks via DFA Shaobo Li Qun Liu Xin Jiang Yichun Yin Chengjie Sun Bingquan Liu Zhenzhou Ji Lifeng Shang 36 1 0 07 Sep 2021
Induction of Subgoal Automata for Reinforcement Learning Daniel Furelos-Blanco Mark Law A. Russo Krysia Broda Anders Jonsson 87 33 0 29 Nov 2019
Weighted Automata Extraction from Recurrent Neural Networks via Regression on State Spaces Takamasa Okudono Masaki Waga Taro Sekiyama I. Hasuo 112 37 0 05 Apr 2019