【摘要】 本文对不完全确定的时序机的化简提出了一种快速算法,它不需要在一开始就准备一个庞大的相容类全集,而是先初步确定一个覆盖了全部状态而包含相容类数不多的“候选集”,在选择最小闭覆盖成员的过程中,不断修改这个“候选集”,使最小闭覆盖的成员逐渐引入“候选集”,从而较快地得到所求结果。更多还原

【Abstract】 A fast algorithm for the minimization of incompletely specified sequential machines is presented. It is not necessary to prepare a large set of primary compatibles at the first stage of selection; rather, the only necessity is to select a "candidate set" of compatibles which is composed of a small number of compatibles and is a cover of the original machine. During the process of selection, the "candidate set" is revised step by step, so as to satisfy the condition for forming a minimal closed cover.更多还原