增加结构非循环模糊自动机最小化算法(英文)

Incremental Construction of Minimal Acyclic Deterministic Fuzzy Finite Automaton

我们提出了一种新的不完全的增加结构算法,该算法结合了非循环确定模糊自动机的性质。由于该算法与隶属度有关,因此算法给出了与传统方法不同的运算函数,而且通过构造模拟状态使该算法可在有多输入状态的条件下运行。所以这个新的不完全增加结构算法较传统算法更可行和实用。新算法由两部分构成:增加模糊字符串到最小非循环确定模糊自动机和最小化增加模糊字符串后得到的自动机。因为在增加模糊字符串到最小非循环确定模糊自动机的过程中,运用了一些相关的新函数,所以得到的自动机仍然是确定的,而且没有增加任何无关的字符串到自动机的可识别语言。

We presented a new semi-incremental algorithm, which combines with properties of acyclic deterministic fuzzy automata. Because the algorithm is related with fuzzy membership, we present some novel functions which make the new algorithm different from general algorithm. It can be applied to multi-incoming （transitions） states by applying build-imitate state. So the new semi-incremental algorithm is more useful and practical. 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. Because some novel functions are applied in the algorithm for adding fuzzy stings to ADFFAs. The resulting automaton of the algorithm is still deterministic and is not added more than one fuzzy string to automaton.