Neural Computation, Vol 10, 1067-1069, Copyright © 1998 by The MIT Press

NOTES

Correction To Proof That Recurrent Neural Networks Can Robustly Recognize Only Regular Languages

Michael Casey

Our earlier article, "The Dynamics of Discrete-Time Computation, with Application to Recurrent Neural Networks and Finite State Machine Extraction" (Casey, 1996), contains a corollary that shows that finite dimensional recurrent neural networks with noise in their state variables that perform algorithmic computations can perform only finite state machine computations. The proof of the corollary is technically incorrect. The problem resulted from the fact that the proof of the theorem on which the corollary is based was more general than the statement of the theorem, and it was the contents of the proof rather than the statement that were used to prove the corollary. In this note, we state the theorem in the necessary generality and then give the corrected proof of the corollary.

This article has been cited by other articles:

				R. C. Carrasco, M. L. Forcada, M. A. Valdés-Muñoz, and R. P. Ñeco Stable Encoding of Finite-State Machines in Discrete-Time Recurrent Neural Nets with Sigmoid Units Neural Comput., September 1, 2000; 12(9): 2129 - 2174. [Abstract] [Full Text]