最小自动机

This paper is concerned with the classification of fuzzy finite automata and the minimization algorithm of fuzzy finite automata.

本文研究了模糊有限自动机的分类和模糊有限自动机的状态最小化算法。

This paper studies the properities of weakly invertible Linear finite automata through zero state,and obtains some results of weakly invertibility of Linear finite automata and description of the minimal linear finite sub-automata.

通过零状态研究了线性有限自动机的一些性质，得到了线性有限自动机弱可逆的一些结果，并给出了最小线性子有限自动机的描述，最后给出了算法实现。

From the equivalence relations, a minimal form is defined and a minimization algorithm of the Mealy type of fuzzy finite automata is obtained.

两类状态等价关系被引进，进而定义了该Mealy型模糊有限状态自动机的最小化形式，最后得到了该Mealy型模糊有限状态自动机的一种状态最小化约简的算法。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。