Abstract: In this paper some research is made on the main steps for reducing incompletely specified sequential machines. A complete algorithm for finding the minimal state table is presented according to a new method to meet the cover requirement first and then the minimum and the closure.