Abstract: In this paper，the relationships of fuzzy recognizers and finite automata is discussed.When the same input alphabet is given，the conclusion is proved that given any fuzzy recognizer，inevitably there is a finite automata，the acceptable language of which is the same as the behavior of the fuzzy recognizer，and conversely，given any finite automata，there exists a fuzzy recognizer，the behavior of which is the same as the acceptable language of the finite automata.Thus，the equivalence between them is obtained.

Key words: fuzzy recognizer, finite automata, fuzzy set, state machine

摘要： 针对模糊识别器与有穷自动机的关系，证明了当输入字母表相同时，任给一个模糊识别器，必然存在一个有穷自动机，使得模糊识别器的行为与有穷自动机所接受的语言相同；反之，任给一个有穷自动机，必然存在一个模糊识别器，使得有穷自动机所接受的语言与模糊识别器的行为相同，从而得出它们之间的等价性。

关键词: 模糊识别器, 有穷自动机, 模糊集, 状态机