在此基础上，得到了求完全定义时序机状态化简的算法。
On this basis, an algorithm for state minimization of completely specified sequential machine is obtained.
本文提出不完全指定的时序机状态化简的一种计算机算法。
An algorithm for minimizing the number of states in an Incompletely Specified Sequential Machine (ISSM) is put forword.
提取模型客户端通过自然的、由上而下的过程优化简化了状态管理。
The pull model client simplifies state management by a natural, top-down procedural refinement.
应用推荐