有限自动机的线性化

THE LINEARIZATION OF FINITE AUTOMATA

采用多值逻辑函数的结构理论，首次定出了有限自动机线性化的充要条件；证明了基本线性内动机等价于序列密码中具有既约特征多项式的ＬＦＳＲ。

It is the first time that we presented the necessary and sufficient condition for linearizing finite automata,proved that basic linear autonomous machines is equivalent to the LFSR which has an exceptionally characterized polynomial in its sequence cipher,and defined all kinds of the autonomous of this type distinctly.