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.
英
美
- 作者讨论了有限态确定模糊自动机FDA与它相应的模糊语言以及FDA与其它自动机的等价性。