Intuitionistic fuzzy recognizers and intuitionistic fuzzy finite automata |
| |
| Authors: | Xiaowei Zhang Yongming Li |
| |
| Affiliation: | (1) College of Mathematics and Information Science, Shaanxi Normal University, 710062 Xi’an, China;(2) College of Computer Science, Shaanxi Normal University, 710062 Xi’an, China |
| |
| Abstract: | Intuitionistic fuzzy recognizers and intuitionistic fuzzy finite automata are discussed. The notions of intuitionistic fuzzy recognizer, complete accessible intuitionistic fuzzy recognizer, intuitionistic fuzzy finite automata, deterministic intuitionistic fuzzy finite automata, and intuitionistic fuzzy language are introduced. It is shown that the languages recognized by intuitionistic fuzzy recognizer are regular, and the intuitionistic fuzzy languages recognized by the intuitionistic fuzzy finite automaton and the intuitionistic fuzzy languages recognized by deterministic intuitionistic fuzzy finite automaton are equivalent. This work is supported by National Science Foundation of China (Grant No.10571112), “TRAPOYT” of China and National 973 Foundation Research Program(Grant No.2002CB312200). |
| |
| Keywords: | Intuitionistic fuzzy recognizer Intuitionistic fuzzy finite automaton Deterministic intuitionistic fuzzy finite automaton Intuitionistic fuzzy language |
| 本文献已被 SpringerLink 等数据库收录！ |
|
