350 rub
Journal Neurocomputers №8 for 2013 г.
Article in number:
Linear automaton functions with superposition-s operations
Keywords: finite automata linear sequential circuits function of linear automata operation of superposition completeness problem criteria of completeness pre-complete class adder delay
Authors:
A.A. Chasovskikh
Abstract:
Modeling neural networks with memory schemes over the threshold functions and delays, we obtain the class Р of finite deterministic functions. The study of the properties of this class, considered together with the operation of a composition or superposition, is difficult, because of the continuity of the sets of pre-complete subclasses. Therefore, closed subclasses Р with independent significance are of interest.
Pages: 3-13
References

  1. Zaxarchuk I.I. Metody' nelinejnoj fil'traczii dvumerny'x massivov na osnove kletochno-nejronny'x modelej // Nejrokomp'yutery': razrabotka, primenenie. 2005. № 10-11.
  2. Kudryavczev V. B., Aleshin S. V., Podkolzin A. S. E'lementy' teorii avtomatov. M.: MGU. 1978.
  3. Chasovskix A. A. O polnote v klasse linejny'x avtomatov // Matematicheskie voprosy' kibernetiki. M.: Nauka. 1991. Vy'p. 3. S. 140-166.