The relationships among several types of fuzzy automata

被引：50

作者：

Li, Zhihui

Li, Ping

Li, Yongming ^{[1
]}

机构：

[1] Shaanxi Normal Univ, Coll Math & Informat Sci, Inst Fuzzy Syst, Xian 710062, Peoples R China

[2] Northwestern Polytech Univ, Dept Automat Control, Xian 710072, Peoples R China

来源：

INFORMATION SCIENCES | 2006年 / 176卷 / 15期

基金：

中国国家自然科学基金;

关键词：

fuzzy automaton; lattice-ordered monoid; fuzzy language; equivalence;

D O I：

10.1016/j.ins.2005.05.001

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We discuss the relationships among several types of fuzzy automata in which all fuzzy sets are defined by membership functions whose codomains are a lattice-ordered monoid L. These automata include nondeterministic L-valued finite automata with Lambda-move, nondeterministic L-valued finite automata, deterministic L-valued finite automata, and L-valued finite-state automata. We consider all that come with fuzzy initial states and fuzzy final states or with crisp initial states or crisp final states. Some comparative results concerning the power of fuzzy automata used in the existing literature to recognize fuzzy languages are given systematically. (C) 2005 Elsevier Inc. All rights reserved.

引用

页码：2208 / 2226

页数：19

共 35 条

[1] Algebraic aspects of families of fuzzy languages [J].