| 模糊识别器与有穷自动机的等价性 |
| |
| 引用本文： | 汤恒琦,邓培民,易忠. 模糊识别器与有穷自动机的等价性[J]. 计算机工程与应用, 2008, 44(9): 33-36. DOI: 10.3778/j.issn.1002-8331.2008.09.010 |
| |
| 作者姓名： | 汤恒琦 邓培民 易忠 |
| |
| 作者单位： | 广西师范大学,数学科学学院,广西,桂林,541004;广西师范大学,数学科学学院,广西,桂林,541004;广西师范大学,数学科学学院,广西,桂林,541004 |
| |
| 基金项目： | 国家自然科学基金 , 教育部高等学校优秀青年教师教学科研奖励计划 , 广西自然科学基金 , 广西研究生教育创新计划 |
| |
| 摘 要： | 针对模糊识别器与有穷自动机的关系，证明了当输入字母表相同时，任给一个模糊识别器，必然存在一个有穷自动机，使得模糊识别器的行为与有穷自动机所接受的语言相同；反之，任给一个有穷自动机，必然存在一个模糊识别器，使得有穷自动机所接受的语言与模糊识别器的行为相同，从而得出它们之间的等价性。
|
| 关 键 词： | 模糊识别器 有穷自动机 模糊集 状态机 |
| 文章编号： | 1002-8331(2008)09-0033-04 |
| 收稿时间： | 2007-09-18 |
| 修稿时间： | 2007-09-18 |
Equivalence between fuzzy recognizers and finite automata |
| |
| TANG Heng-qi,DENG Pei-min,YI Zhong. Equivalence between fuzzy recognizers and finite automata[J]. Computer Engineering and Applications, 2008, 44(9): 33-36. DOI: 10.3778/j.issn.1002-8331.2008.09.010 |
| |
| Authors: | TANG Heng-qi DENG Pei-min YI Zhong |
| |
| Affiliation: | College of Mathematics Science，Guangxi Normal University，Guilin，Guangxi 541004，China |
| |
| 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. |
| |
| Keywords: | fuzzy recognizer finite automata fuzzy set state machine |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载免费的PDF全文 |
|
