Discrete Recurrent Neural Networks as Pushdown Automata
暂无分享，去创建一个
In this paper, we describe a new discrete recurrent model with discrete external stacks for learning context-free grammars (or pushdown automata).
[1] Padhraic Smyth,et al. Discrete recurrent neural networks for grammatical inference , 1994, IEEE Trans. Neural Networks.
[2] C. Lee Giles,et al. Using Prior Knowledge in a {NNPDA} to Learn Context-Free Languages , 1992, NIPS.
[3] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[4] Padhraic Smyth,et al. Learning Finite State Machines With Self-Clustering Recurrent Networks , 1993, Neural Computation.