Bounds on the complexity of recurrent neural network implementations of finite state machines
- 31 March 1996
- journal article
- Published by Elsevier in Neural Networks
- Vol. 9 (2) , 243-252
- https://doi.org/10.1016/0893-6080(95)00095-x
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On the node complexity of neural networksNeural Networks, 1994
- Analog computation via neural networksTheoretical Computer Science, 1994
- Neural Networks and Nonlinear Adaptive Filtering: Unifying Concepts and New AlgorithmsNeural Computation, 1993
- Forward Models: Supervised Learning with a Distal TeacherCognitive Science, 1992
- Induction of Finite-State Languages Using Second-Order Recurrent NetworksNeural Computation, 1992
- FIR and IIR Synapses, a New Neural Network Architecture for Time Series ModelingNeural Computation, 1991
- Efficient simulation of finite automata by neural netsJournal of the ACM, 1991
- Finding Structure in TimeCognitive Science, 1990
- Identification and control of dynamical systems using neural networksIEEE Transactions on Neural Networks, 1990
- A logical calculus of the ideas immanent in nervous activityBulletin of Mathematical Biology, 1943