Abstract
The problem of the minimization of the set of attributes (key-finding) in a given i.s.r. system is proved to be equivalent to prime implicant finding for a certain term. The equivalence between the minimalization of the set of attributes and minimal test finding is exhibited. As a consequence, minimal test finding algorithms are also applicable to the present problem.
Get full access to this article
View all access options for this article.