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 条
  • [31] Some properties of fuzzy languages
    Moraga, Claudio
    COMPUTATIONAL INTELLIGENCE, THEORY AND APPLICATION, 2006, : 367 - 374
  • [32] A family of fuzzy programming languages
    MoralesBueno, R
    PerezdelaCruz, JL
    Conejo, R
    Clares, B
    FUZZY SETS AND SYSTEMS, 1997, 87 (02) : 167 - 179
  • [33] Characterization of Fuzzy Regular Languages
    Ramaswamy, V.
    Girijamma, H. A.
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2008, 8 (12): : 306 - 308
  • [34] Recognizability of morphisms
    Beal, Marie-Pierre
    Perrin, Dominique
    Restivo, Antonio
    ERGODIC THEORY AND DYNAMICAL SYSTEMS, 2023, 43 (11) : 3578 - 3602
  • [35] Recognizability for Automata
    Caucal, Didier
    Rispal, Chloe
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2018, 2018, 11088 : 206 - 218
  • [36] Deterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages
    Arulprakasam, R.
    Dare, V. R.
    Gnanasekaran, S.
    IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS, 2019, 14 (01): : 1 - 11
  • [37] FUZZY GRAMMARS AND RECURSIVELY-ENUMERABLE FUZZY LANGUAGES
    GERLA, G
    INFORMATION SCIENCES, 1992, 60 (1-2) : 137 - 143
  • [38] Losing recognizability
    Vagvolgyi, Sandor
    THEORETICAL COMPUTER SCIENCE, 2007, 379 (1-2) : 298 - 304
  • [39] The Languages I Speak
    Shiferraw, Mahtem
    WORLD LITERATURE TODAY, 2018, 92 (03) : 16 - 16
  • [40] Timed automata and recognizability
    Hermann, P
    INFORMATION PROCESSING LETTERS, 1998, 65 (06) : 313 - 318
12345