计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (9): 33-36.

• 理论研究 • 上一篇    下一篇

模糊识别器与有穷自动机的等价性

汤恒琦,邓培民,易 忠   

  1. 广西师范大学 数学科学学院,广西 桂林 541004
  • 收稿日期:2007-09-18 修回日期:2007-12-04 出版日期:2008-03-21 发布日期:2008-03-21
  • 通讯作者: 汤恒琦

Equivalence between fuzzy recognizers and finite automata

TANG Heng-qi,DENG Pei-min,YI Zhong   

  1. College of Mathematics Science,Guangxi Normal University,Guilin,Guangxi 541004,China
  • Received:2007-09-18 Revised:2007-12-04 Online:2008-03-21 Published:2008-03-21
  • Contact: TANG Heng-qi

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

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

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