On fuzzy regular languages

D. S. Malik; John N. Mordeson; M. K. Sen

doi:10.1016/0020-0255(95)00167-0

On fuzzy regular languages

D. S. Malik, John N. Mordeson, M. K. Sen

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

29 Scopus citations

Abstract

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

Original language	English (US)
Pages (from-to)	263-273
Number of pages	11
Journal	Information sciences
Volume	88
Issue number	1-4
DOIs	https://doi.org/10.1016/0020-0255(95)00167-0
State	Published - Jan 1996

All Science Journal Classification (ASJC) codes

Software
Control and Systems Engineering
Theoretical Computer Science
Computer Science Applications
Information Systems and Management
Artificial Intelligence

Access to Document

10.1016/0020-0255(95)00167-0

Cite this

@article{97ea9360e56446189c879a0281a03fc6,

title = "On fuzzy regular languages",

abstract = "We introduce the concept of a max-min fuzzy language, FL ∨(M), and a min-max fuzzy language, FL ∧(M), recognized by a type of fuzzy automaton M. We show that if L1 and L2 are finite-valued F ∨-regular languages, then so are L1 ∪ L2 and L1 ∩ L2. We give a form of a fuzzified pumping lemma which we use to give a necessary and sufficient condition for FL ∨(M) to be nonconstant.",

author = "Malik, {D. S.} and Mordeson, {John N.} and Sen, {M. K.}",

year = "1996",

month = jan,

doi = "10.1016/0020-0255(95)00167-0",

language = "English (US)",

volume = "88",

pages = "263--273",

journal = "Information Sciences",

issn = "0020-0255",

publisher = "Elsevier Inc.",

number = "1-4",

}

TY - JOUR

T1 - On fuzzy regular languages

AU - Malik, D. S.

AU - Mordeson, John N.

AU - Sen, M. K.

PY - 1996/1

Y1 - 1996/1

N2 - We introduce the concept of a max-min fuzzy language, FL ∨(M), and a min-max fuzzy language, FL ∧(M), recognized by a type of fuzzy automaton M. We show that if L1 and L2 are finite-valued F ∨-regular languages, then so are L1 ∪ L2 and L1 ∩ L2. We give a form of a fuzzified pumping lemma which we use to give a necessary and sufficient condition for FL ∨(M) to be nonconstant.

AB - We introduce the concept of a max-min fuzzy language, FL ∨(M), and a min-max fuzzy language, FL ∧(M), recognized by a type of fuzzy automaton M. We show that if L1 and L2 are finite-valued F ∨-regular languages, then so are L1 ∪ L2 and L1 ∩ L2. We give a form of a fuzzified pumping lemma which we use to give a necessary and sufficient condition for FL ∨(M) to be nonconstant.

UR - http://www.scopus.com/inward/record.url?scp=0029754977&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029754977&partnerID=8YFLogxK

U2 - 10.1016/0020-0255(95)00167-0

DO - 10.1016/0020-0255(95)00167-0

M3 - Article

AN - SCOPUS:0029754977

VL - 88

SP - 263

EP - 273

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

IS - 1-4

ER -

On fuzzy regular languages

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this