On fuzzy regular languages

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

Research output: Contribution to journal › Article

23 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)263-273
Number of pages11
JournalInformation Sciences
Volume88
Issue number1-4
StatePublished - Jan 1996

Fingerprint

Formal languages
Regular Languages
Min-max
Fuzzy Automata
Lemma
Necessary Conditions
Sufficient Conditions
Language
Form
Concepts

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Computer Science Applications
  • Information Systems
  • Information Systems and Management
  • Statistics, Probability and Uncertainty
  • Electrical and Electronic Engineering
  • Statistics and Probability

Cite this

Malik, D. S., Mordeson, J. N., & Sen, M. K. (1996). On fuzzy regular languages. Information Sciences, 88(1-4), 263-273.

On fuzzy regular languages. / Malik, Davender S.; Mordeson, John N.; Sen, M. K.

In: Information Sciences, Vol. 88, No. 1-4, 01.1996, p. 263-273.

Research output: Contribution to journal › Article

Malik, DS, Mordeson, JN & Sen, MK 1996, 'On fuzzy regular languages', Information Sciences, vol. 88, no. 1-4, pp. 263-273.
Malik DS, Mordeson JN, Sen MK. On fuzzy regular languages. Information Sciences. 1996 Jan;88(1-4):263-273.
Malik, Davender S. ; Mordeson, John N. ; Sen, M. K. / On fuzzy regular languages. In: Information Sciences. 1996 ; Vol. 88, No. 1-4. pp. 263-273.
@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, {Davender S.} and Mordeson, {John N.} and Sen, {M. K.}",
year = "1996",
month = "1",
language = "English",
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, Davender 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

M3 - Article

VL - 88

SP - 263

EP - 273

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

IS - 1-4

ER -

Access to Document