On one essential condition in recognition of finite sets
Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta, no. 2 (2006), pp. 113-116
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
Condition which increase the efficiancy of finite sets recognition is made.
[1] Belousov V. A., Kalyadin N. I., “Algoritm postroeniya etalonnykh mnozhestv pri silnom slipanii mnozhestv v obuchenii”, Matematicheskie algoritmy, Tez. vtoroi mezhdunar. konf., Izd-vo NNGU, N. Novgorod, 1995, 8
[2] Belousov V. A., Kalyadin N. I., “O nekotorykh klassakh razbienii konechnykh semeistv konechnykh mnozhestv”, Mezhvuz. sb., Avtomaticheskie ustroistva ucheta i kontrolya, 11, IMI, Izhevsk, 1976, 84–94
[3] Belousov V. A., Kalyadin N. I., “O zadache klassifikatsii mnozhestv naturalnykh chisel”, Tez. dokl. III konf. ROAI, v. I, N. Novgorod, 1997, 94–97