On the recognizability of Fuzzy languages I

被引：26
|
作者：
Bozapalidis, Symeon [1 ]
Louscou-Bozapalidou, Olympia
机构：
[1] Aristotle Univ Thessaloniki, Dept Math, Thessaloniki 54124, Greece
[2] Tech Inst W Macedonia, Sect Math & Informat, Koila, Kozani, Greece
来源：
FUZZY SETS AND SYSTEMS | 2006年 / 157卷 / 17期
关键词：
fuzzy automata; language derivatives; pumping lemma;
D O I：
10.1016/j.fss.2006.04.008
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Fuzzy language recognizability via finite monoids (called m-recognizability) is examined. Fuzzy languages computed by (max, min)-automata, (max, Delta(L))-automata and (max, Delta(D))-automata are m-recognizable (Delta(L), Delta(D) are the Lucasiewicz intersection and the drastic intersection, respectively). The syntactic monoid associated to each m-recognizable language can be effectively constructed. Thus, the equality of two m-recognizable fuzzy languages is decidable. A pumping lemma is displayed. (C) 2006 Elsevier B.V. All rights reserved.
引用
下载
收藏
页码：2394 / 2402
页数：9
相关论文
共 50 条
12345