基于矩阵模型的有限自动机的综合

The integration of finite automaton based on matrix model.

研究如何构造有限自动机,使得每一输入的内动部分的图形为给定的图形,即每一给定的图形为该有限自动机在某输入下的内动部分的图形;对给定的常量布尔方阵C,是否存在满足一定条件的有限自动机,使得该自动机总图的拟邻接矩阵为C,给出了判断的充要条件及构造算法;设计了时序电路模拟自动机,该时序电路实现给定的图形或拟邻接矩阵。

The author research how to constract a finite automata so that the internal pards graph for a input is the same as given graph, i.e. the given graph is the internal pards graph of the automata for a input. For a given constant bool matrix C, author provide the construct algorithm and the condition to judge whether there is a finfite automata which the s＇lmilar-neighbourhood matrix is C. Design a sequence circuit to realize the automata which the sequence circuit perform given graph or similar-neighbourhood matrix.