A problem of completeness of S-sets of deterministic functions
V. A. Buevich, M. A. Podkolzina · Moscow University Mathematics Bulletin · 2008
A problem of completeness of S-deterministic functions determined on words of length τ is considered. The set of all precomplete classes forming the minimal criterial system for recognition of the completeness of arbitrary S-sets of deterministic functions is described in terms of preservation of relations (predicates).