Regular grammars with truth values in lattice-ordered monoid and their languages

被引：12
作者：
Sheng, L [1 ]
Li, YM [1 ]
机构：
[1] Shaanxi Normal Univ, Coll Math & Informat Sci, Inst Fuzzy Syst, Xian 710062, Peoples R China
来源：
SOFT COMPUTING | 2006年 / 10卷 / 02期
关键词：
fuzzy finite automata; fuzzy regular grammar; fuzzy regular language; lattice-ordered monoid;
D O I：
10.1007/s00500-004-0427-y
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this study, we introduce the concept of lattice-valued regular grammars. Such grammars have become a necessary tool for the analysis of fuzzy finite automata. The relationship between lattice-valued finite automata (LA) and lattice-valued regular grammars (LRG) are discussed and we get the following results, for a given LRG, there exists an LA such that they accept the same languages, and vice versa. We also show the equivalence between deterministic lattice-valued regular grammars and deterministic lattice-valued finite automata.
引用
收藏
页码：79 / 86
页数：8
相关论文
共 24 条
[1]   Algebraic aspects of families of fuzzy languages [J].
Asveld, PRJ .
THEORETICAL COMPUTER SCIENCE, 2003, 293 (02) :417-445
[2]  
Balbes R., 1974, DISTRIBUTIVE LATTICE
[3]   Determinism and fuzzy automata [J].
Belohlávek, R .
INFORMATION SCIENCES, 2002, 143 (1-4) :205-209
[4]  
Birkhoff G., 1973, Lattice Theory
[5]  
Hopcroft J. E., 2007, Introduction to Automata Theory, Languages and Computation
[6]  
Kandel A., 1980, Fuzzy Switching and Automata Theory and Applications
[7]   NOTE ON FUZZY LANGUAGES [J].
LEE, ET ;
ZADEH, LA .
INFORMATION SCIENCES, 1969, 1 (04) :421-&
[8]   Remarks on uninorm aggregation operators [J].
Li, YM ;
Shi, ZK .
FUZZY SETS AND SYSTEMS, 2000, 114 (03) :377-380
[9]  
Li YM, 2004, NAFIPS 2004: ANNUAL MEETING OF THE NORTH AMERICAN FUZZY INFORMATION PROCESSING SOCIETY, VOLS 1AND 2, P572
[10]  
Li YM, 2002, J PURE APPL ALGEBRA, V176, P249
123