We give a necessary condition that a simple recurrent neural network with two sigmoidal hidden units to implement a recognizer of the formal language {a n b n | n > 0 } which is generated by a set of generating rules {S→aSb, S→ab } and show that by setting parameters so as to conform to the condition we get a recognizer of the language. The condition implies instability of learning process reported in previous studies. The condition also implies, contrary to its success in implementing the recognizer, difficulty of getting a recognizer of more complicated languages. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Iwata, A., Shinozawa, Y., & Sakurai, A. (2008). A characterization of simple recurrent neural networks with two hidden units as a language recognizer. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4984 LNCS, pp. 436–445). https://doi.org/10.1007/978-3-540-69158-7_46
Mendeley helps you to discover research relevant for your work.