On fuzzy regular languages

被引：25

作者：

Malik, DS ^{[1
]}

Mordeson, JN ^{[1
]}

Sen, MK ^{[1
]}

机构：

[1] UNIV CALCUTTA,DEPT PURE MATH,CALCUTTA 700019,W BENGAL,INDIA

来源：

INFORMATION SCIENCES | 1996年 / 88卷 / 1-4期

关键词：

D O I：

10.1016/0020-0255(95)00167-0

中图分类号：

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

学科分类号：

0812 ;

摘要：

We introduce the concept of a max-min fuzzy language, FL boolean OR(M), and a min-max fuzzy language, FL boolean AND(M), recognized by a type of fuzzy automaton M. We show that if L(1) and L(2) are finite-valued F boolean OR-regular languages, then so are L(1) boolean OR L(2) and L(1) boolean AND L(2). We give a form of a fuzzified pumping lemma which we use to give a necessary and sufficient condition for FL boolean OR(M) to be nonconstant.

引用

页码：263 / 273

页数：11