deterministic finite state 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.
新算法由兩部分搆成：增加模糊字符串到最小非循環(huán)確定模糊自動(dòng)機(jī)和最小化增加模糊字符串後得到的自動(dòng)機(jī)。
In this paper, it is mainly discussed a finite-state deterministic fuzzy automaton(FDA), which is not only equivalent to corresponding fuzzy language and is also equally powerful as other automata.
作者討論了有限態(tài)確定模糊自動(dòng)機(jī)FDA與它相應(yīng)的模糊語言以及FDA與其它自動(dòng)機(jī)的等價(jià)性。