研究自动机的方法有状态转换函数、RTL、VHDL以及矩阵形式等方法.矩阵形式与其它方法相比能很好地完成对自动机状态转化过程的演算.自动机是描述集合之间某种关系,它的工作过程是一种逻辑推理过程.根据自动机的逻辑形式定义,结合矩阵方式,建立了自动机的矩阵逻辑运算方程;同时讨论了矩阵表示的有关性质.
There are several different methods to study deterministic finite automata (abb. DFA) : state transition function, RTL, VHDL and matrix format. As compared with others, the last one can perform beffer the caculation of the state transition. DFA describe some relations between sets. Their function is in fact a logic reasoning. In this paper, based on the logical definition of DFA, by employing matrix format, a matrix logical equation is established for DFA. Moreover, some properties are discussed.