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

共 9 条

[1] Fuzzy context-free languages - Part 2: Recognition and parsing algorithms
Asveld, PRJ
[J]. THEORETICAL COMPUTER SCIENCE, 2005, 347 (1-2) : 191 - 213
[2] Fuzzy context-free languages - Part 1: Generalized fuzzy context-free grammars
Asveld, PRJ
[J]. THEORETICAL COMPUTER SCIENCE, 2005, 347 (1-2) : 167 - 190
[3] Algebraic aspects of families of fuzzy languages
Asveld, PRJ
[J]. THEORETICAL COMPUTER SCIENCE, 2003, 293 (02) : 417 - 445
[4] EILENBERG S, 1974, LANGUAGES MACHINES, VA
[5] EILENBERG S, 1977, LANGUAGES MACHINES, VB
[6] Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
Li, YM
Pedrycz, W
[J]. FUZZY SETS AND SYSTEMS, 2005, 156 (01) : 68 - 92
[7] Mordeson JN, 2002, COMP MATH SERIES, pIX
[8] NGUYEN HT, 1977, 1 COURSE FUZZY LOGIC
[9] Infinite fuzzy computations
Rahonis, G
[J]. FUZZY SETS AND SYSTEMS, 2005, 153 (02) : 275 - 288

← 1 →