Cite this article as:
Slepovichev I. I. Algebraic properties of recurrent neural networks of discrete time. Izv. Saratov Univ. (N. S.), Ser. Math. Mech. Inform., 2005, vol. 5, iss. 1, pp. 116-?.
Algebraic properties of recurrent neural networks of discrete time
Artificial neural networks can be used effectively for a quite general class of problems. Still there exists no formal foundation of some important constructions used in the theory. In this paper an attempt is undertaken to formalize some concepts of neuroinformatics and consider their properties from the point of view of applied universal algebra. It is proposed to treat neural networks as heterogeneous algebras which has made it possible to prove for them basic results similar to algebraic theorems on homomorphisms and congruences.
[1] McCulloc W. S., Pitts W. Н., “A logical calculus of the ideas immanent in nervous activity”, Bull. of Math. Biophysics, 5 (1943), 115–133
[2] Псиола В. В., “Обзор основных нейросетевых моделей”, Интеллектуальные системы, 4:3–4 (1999), 139–172
[3] Богомолов А. М., Салий В. Н., Алгебраические основы теории дискретных систем, М., 1997, 11
[4] Carrasco R. C., Mikel J. O., Forcada L., Efficient Encodings of finite automata in discrete-time recurrent neural networks
