A problem is solved on description of a set of functional universal constraints for classification algorithms corresponding to particular systems of symmetrical universal constraints. The problem considered is a part of the algebraic approach to the problem of synthesis of correct recognition algorithms. The problem of description is studied for a set of functional signatures, corresponding to one and the same unknown group. Only permissible functional signatures, satisfying the specified condition, are considered. The theorem of equivalence of signatures without stationary pairs. The given theorem provides the description of a set of equivalent functional signatures.
|Original language||English (US)|
|Number of pages||5|
|Journal||Kibernetika i Vychislitel'naya Tekhnika|
|State||Published - Mar 1991|
ASJC Scopus subject areas