Induction of Finite-State Languages Using Second-Order Recurrent Networks-Reference-Cited by-同舟云学术

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

Published:1992-05 Issue:3 Volume:4 Page:406-414
ISSN:0899-7667
Container-title:Neural Computation
language:en
Short-container-title:Neural Computation

Author:

Watrous Raymond L.¹,Kuhn Gary M.²

Affiliation:

1. Siemens Corporate Research, 755 College Road East, Princeton, NJ 08540 USA

2. Center for Communications Research, IDA, Thanet Road, Princeton, NJ 08540 USA

Abstract

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.

Publisher

MIT Press - Journals

Subject

Cognitive Neuroscience,Arts and Humanities (miscellaneous)

Link

https://www.mitpressjournals.org/doi/pdf/10.1162/neco.1992.4.3.406

Reference6 articles.

1. Finite State Automata and Simple Recurrent Networks

Cited by 91 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Residual stacked gated recurrent unit with encoder–decoder architecture and an attention mechanism for temporal traffic prediction;Soft Computing;2022-06-24

2. Denoising temporal convolutional recurrent autoencoders for time series classification;Information Sciences;2022-04

3. Quantum speed-up in global optimization of binary neural nets;New Journal of Physics;2021-06-01

4. Distillation of weighted automata from recurrent neural networks using a spectral approach;Machine Learning;2021-04-19

5. Overcoming the Vanishing Gradient Problem during Learning Recurrent Neural Nets (RNN);Asian Journal of Applied Science and Engineering;2020-12-31