We can evaluate this article by the same way as the authors do it in the conclusion: “The principal contributions of this paper are:
1) A simple and efficient method for the minimization of incompletely specified-sequential machines (ISSM) is developed. The central theme of the new method is to weed out such of those compatibles which cannot be members of any minimal closed cover and further ignore a substantial number of compatibles, elimination of which does not preclude finding at least one minimal closed cover. The tests proposed to achieve this objective are extremely simple and are easily implemented as very first stage in the process of minimizing an ISSM. As a consequence, we have to deal with a relatively small set of compatibles only.
2) A lower upper bound for the cardinality of the minimal closed cover is proposed and a technique to find it has been presented.
3) Rank of a compatible is defined and it is shown, that ordering the compatibles in accordance with their rank reduces the amount of work involved.
4) An improved technique of generating prime closed sets, which converges faster to the solution, is proposed.”
The method proposed in this paper are simple, efficient and systematic, and they are programmable.