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

Equivalence between fuzzy recognizers and finite automata

作　　者：汤恒琦[1] 邓培民[1] 易忠[1] 

机构地区：[1]广西师范大学数学科学学院,广西桂林541004

出　　处：《计算机工程与应用》2008年第9期33-36,共4页Computer Engineering and Applications

基　　金：国家自然科学基金(the National Natural Science Foundation of China under Grant No.60473005);教育部优秀青年教师资助计划(theSubsidy Scheme of Ministry of Education of China to Outstanding Young Teacher Under Grant No.2002-40);广西自然科学基金(theNatural Science Foundation of Guangxi Zhuang Autonomous Region of China Under Grant No.0640061);广西研究生教育创新计划项目(Innovation Project of Guangxi Graduate Education Under Grant No.2007106020701M48)

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

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

分 类 号：TP301.1[自动化与计算机技术—计算机系统结构]