介绍以隐含最大相容类集为基础的经济型状态化简新算法。该算法是从最大隐含相容类集得出最小闭覆盖的初始候选集，通过对初始候选集的不断调整，得到化简结果。通过与一个具有代表性的经济型算法软件的比较发现，用该算法实现的软件，除少数情况外，可对大量状态机进行更有效的状态化简。 This paper introduces a new economical state-based algorithm based on implied maximum compatible class sets. The algorithm obtains the initial candidate set of the minimum closed cover from the maximum implicit compatible set, and through the continuous adjustment of the initial candidate set, the simplified result is obtained. Comparisons with a representative economic algorithm software show that software implemented with this algorithm can, with a few exceptions, be able to more efficiently state-scale a number of state machines.