This is a preview of subscription content, log in via an institution to check access.
Literature Cited
Yu. I. Zhuravlev, and V. V. Nikiforov, “Recognition algorithm based on calculation of estimates,” Kibernetika, No. 3 (1971).
T. M. Dadashev, “On recognition algorithms which are extremal by prudence thresholds,” Zh. Vychisl. Mat. i Mat. Fiz.,13, No. 3 (1973).
Yu. I. Zhuravlev and Sh. E. Tulyaganov, “Measures of importance of objects in complex systems,” Zh. Vychisl. Mat. i Mat. Fiz.,12, No. 1 (1972).
Pattern Recognition. Proceedings of the 1971 International Symposium on Practical Applications of Pattern-Recognition Methods [in Russian], Vychisl. Tsentr. Akad. Nauk SSSR, Moscow (1973), pp. 205–277.
Yu. I. Zhuravlev, “Set theoretical methods in the algebra of logic,” in: Problems in Cybernetics [in Russian], No. 8, Moscow (1962).
S. N. Chernikov, Linear Inequalities [in Russian], Nauka, Moscow (1968), pp. 302, 316–320.
H. Weyl, “Elementary theory of convex polyhedra,” in: Contributions to the Theory of Games. I., Princeton University Press, Princeton, New Jersey (1950), pp. 3–18.
Additional information
Translated from Kibernetika, No. 6, pp. 121–133, November–December, 1974.
Rights and permissions
About this article
Cite this article
Dadashev, T.M. On logical orbits of recognition systems. Cybern Syst Anal 10, 1050–1062 (1974). https://doi.org/10.1007/BF01069452
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01069452