摘要
应用矩阵模型，提出了一类非完全定义时序机的映射矩阵Ａｉ和Ｂｉ的计算方法和状态相容条件，根据状态相容求出Ｐｋ划分，从而得到了该类时序机状态化简的算法．
By applying matrix model,this paper presents method of solving mapping matrix A i and B i and conditions of state compatibility in Cat.1 incompletely specified sequential machine.According to state compatibility, P k partition of state set can be obtained,so a state minimization algorithm for such kind of machine is derived.
出处
《湖南大学学报（自然科学版）》
EI
CAS
CSCD
1998年第2期103-108,共6页
Journal of Hunan University:Natural Sciences
基金
机械部教育司青年基金
关键词
时序机
状态相容
状态化简
矩阵模型
计算机
incompletely specified sequential machine,state compatibility,state minimization,martix model, P k partition
