Intuitionistic fuzzy finite automata theory is an important part of automata theory.
直觉模糊自动机理论是自动机理论的一个重要分支。
This paper is concerned with the classification of fuzzy finite automata and the minimization algorithm of fuzzy finite automata.
本文研究了模糊有限自动机的分类和模糊有限自动机的状态最小化算法。
The automata of fuzzy or defuzzization what we study are all finite-state automata so far.
到目前为止，我们所研究的模糊或非模糊的自动机都是有限状态自动机。
The new algorithm is composed of two parts: adding fuzzy strings to minimal acyclic deterministic fuzzy finite state automata (ADFFAs) and minimizing the resulting automata.
新算法由两部分构成：增加模糊字符串到最小非循环确定模糊自动机和最小化增加模糊字符串后得到的自动机。
The new algorithm is composed of two parts: adding fuzzy strings to minimal acyclic deterministic fuzzy finite state automata (ADFFAs) and minimizing the resulting automata.
新算法由两部分构成：增加模糊字符串到最小非循环确定模糊自动机和最小化增加模糊字符串后得到的自动机。
应用推荐