论文信息 - Induction of Finite-State Languages Using Second-Order Recurrent Networks

Induction of Finite-State Languages Using Second-Order Recurrent Networks

Second-order recurrent networks that recognize simple finite state languages over {0,1}* are induced from positive and negative examples. Using the complete gradient of the recurrent network and sufficient training examples to constrain the definition of the language to be induced, solutions are obtained that correctly recognize strings of arbitrary length.

Raymond L. Watrous | Gary M. Kuhn | G. Kuhn

[1] Raymond L. Watrous,et al. Complete gradient optimization of a recurrent network applied to /b/,/d/,/g/ discrimination , 1988 .

[2] C. Lee Giles,et al. Higher Order Recurrent Networks and Grammatical Inference , 1989, NIPS.

[3] James L. McClelland,et al. Finite State Automata and Simple Recurrent Networks , 1989, Neural Computation.

[4] Ronald J. Williams,et al. A Learning Algorithm for Continually Running Fully Recurrent Neural Networks , 1989, Neural Computation.

[5] Jeffrey L. Elman,et al. Finding Structure in Time , 1990, Cogn. Sci..

[6] C. L. Giles,et al. Second-order recurrent neural networks for grammatical inference , 1991, IJCNN-91-Seattle International Joint Conference on Neural Networks.