Computation in recurrent neural networks: From counters to iterated function systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1502, Issue , 1998, Pages 179-190

  Kalinke, Yvonne ^a   Lehmann, Helko ^b  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL TASK; DESIGN PRINCIPLES; DYCK LANGUAGE; DYNAMICAL BEHAVIORS; FORMAL ANALYSIS; HIDDEN LAYERS; ITERATED FUNCTION SYSTEM; RECURRENT NEURAL NETWORK (RNN);

RECURRENT NEURAL NETWORKS;

EID: 84947944274     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0095051     Document Type: Conference Paper

References (14)

1. M. Barnsley: Fractals Everywhere. CA: Academic Press, San Diego, 1988.
2. M. Casey. The dynamics of discrete-time computation, with application to recurrent neural networks and finite state machine extraction. Neural Computation, 8(6):1135-1178, 1996.
3. J.L. Elman: Finding Structure in Time. Cognitive Science, 14, pp. 179-211, 1990.
4. J. Wiles and J. Elman: Learning to Count without a Counter: A Case Study of Dynamics and Activation Landscapes in Recurrent Networks. Proceedings of the Seventeenth Annual Conference of the Cognitive Science Society, Cambridge, MA, MIT Press, 1995.
5. C.W. Omlin and C.L. Giles. Constructing deterministic finite-state automata in recurrent neural networks. Journal of the ACM, 45(6):p. 937, 1996.
6. P. Grünwald and M. Steijvers: A Recurrent Network that performs a context-sensitive prediction task. Proceedings of the Eighteenth Annual Conference of the Cognitive Science Society, Morgan Kauffman, 1996.
7. S. Holldobler and Y. Kalinke and H. Lehmann: Designing a Counter: Another Case Study of Dynamics and Activation Landscapes in Recurrent Networks. LNAI 1303, Proceedings of the KI97: Advances in Artificial Intelligence, Springer, pp. 313-324, 1997.
8. M.I. Jordan: Attractor Dynamics and Parallelism in a Connectionist Sequential Machine. Proceedings of the Annual Conference of the Cognitive Science Society, pp. 531-546, 1986.
9. J.F. Kolen: Exploring the Computational Capabilities of Recurrent Neural Networks. PhD Thesis, Ohio State University, 1994.
10. H. Nakahara and K. Doya: Dynamics of Attention as Near Saddle-Node Bifurcation Behavior. In: D.S. Touretzky and M.C. Mozer and M.E. Hasselmo (eds.): Advances in Neural Information Processing Systems, Volume 8, Neural Information Processing Systems 1995, MIT Press, 1996.
11. J.B. Pollack: Recursive Distributed Representations. Artificial Intelligence, 46, pp. 77-105, 1990.
12. P. Rodriguez and J. Wiles: Recurrent Neural Networks Can Learn to Implement Symbol-Sensitive Counting. Proceedings of the 11th Conference on Neural Information Processing Systems, Denver CA, USA, 1998 (to appear).
13. H. Siegelmann and E.D. Sontag. Turing Computability with Neural Nets. Applied Mathematics Letters, 4(6), pp.77-80, 1991.
14. A. Stolcke and D. Wu: Tree Matching with Recursive Distributed Representations. International Computer Science Institute, Berkeley, Technical Report TR-92-025, 1992.