完全定义时序机的状态化简算法

A State Minimization Algorithm for Completely Specified Sequential Machine

在矩阵模型的基础上，提出了求映射矩阵Ｂ（Ｘ）和输出矩阵Ａ（Ｘ）的方法，进而求出Ｋ阶输出矩阵与Ｐｋ划分．在此基础上，得到了求完全定义时序机状态化简的算法．该算法基于矩阵运算。

Based on the matrix model,this paper presents a method to solve mapping matrix B(X) and output matrix A(X) .It also puts forward the solution of K -level output matrix and P k Partition.On this basis,an algorithm for state minimization of completely specified sequential machine is obtained.The algorithm is convenient for parallel implementation on computers because it applies matrix operation.