Author of the publication

Bounds on the Complexity of Recurrent Neural Network Implementations of Finite State Machines.

, and . NIPS, page 359-366. Morgan Kaufmann, (1993)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Learning long-term dependencies is not as difficult with NARX networks., , , and . NIPS, page 577-583. MIT Press, (1995)Error surfaces for multilayer perceptrons., , and . IEEE Trans. Systems, Man, and Cybernetics, 22 (5): 1152-1161 (1992)Computational capabilities of recurrent NARX neural networks., , and . IEEE Trans. Systems, Man, and Cybernetics, Part B, 27 (2): 208-215 (1997)If Piracy Is the Problem, Is DRM the Answer?, , , , and . Digital Rights Management, volume 2770 of Lecture Notes in Computer Science, Springer, (2003)Efficient algorithms for function approximation with piecewise linear sigmoidal networks., and . IEEE Trans. Neural Networks, 9 (6): 1129-1141 (1998)Online prediction of multiprocessor memory access patterns., , , , , and . ICNN, page 1564-1569. IEEE, (1996)On the node complexity of neural networks., and . Neural Networks, 7 (9): 1413-1426 (1994)Bounds on the Complexity of Recurrent Neural Network Implementations of Finite State Machines., and . NIPS, page 359-366. Morgan Kaufmann, (1993)On Computer Security Incident Response Teams.. IEEE Security & Privacy, 12 (5): 13-15 (2014)Attractive Periodic Sets in Discrete-Time Recurrent Networks (with Emphasis on Fixed-Point Stability and Bifurcations in Two-Neuron Networks)., , and . Neural Computation, 13 (6): 1379-1414 (2001)