𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Learning a class of large finite state machines with a recurrent neural network

✍ Scribed by C. Lee Giles; B.G. Horne; T. Lin

Book ID
108019971
Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
655 KB
Volume
8
Category
Article
ISSN
0893-6080

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Bounds on the complexity of recurrent ne
Bounds on the complexity of recurrent neural network implementations of finite state machines
✍ Bill G. Horne; Don R. Hush πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 823 KB

In this paper the efficiency of recurrent neural network implementations of m-state finite state machines will be explored. Specifically, it will be shown that the node complexity for the unrestricted case can be bounded above by O(v/-m-). It will also be shown that the node complexity is 0( ~) when

On a class of efficient learning algorit
On a class of efficient learning algorithms for neural networks
✍ Frank BΓ€rmann; Friedrich Biegler-KΓΆnig πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 457 KB

The ability of a neural network with one hidden layer to accurately learn a specified learning set increases with the number of nodes in the hidden layer; if a network has exactly the same number of internal nodes as the number of examples to be learnt, it is theoretically able to learn these exampl