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 necessay and sufficient condition for FL∨(M) to be nonconstant.
| Original language | English |
|---|---|
| Title of host publication | Joint Conference on Information Sciences - Proceedings, Abstracts and Summaries, JCIS 94 |
| Pages | 35-38 |
| Number of pages | 4 |
| State | Published - 1994 |
| Event | Joint Conference on Information Sciences - Proceedings, Abstracts and Summaries '94 - Pinehurst, NC, United States Duration: Nov 1 1994 → Nov 1 1994 |
Other
| Other | Joint Conference on Information Sciences - Proceedings, Abstracts and Summaries '94 |
|---|---|
| Country | United States |
| City | Pinehurst, NC |
| Period | 11/1/94 → 11/1/94 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Science(all)
Cite this
On Fuzzy Regular Languages. / Malik, Davender S.; Mordeson, John N.; Sen, M. K.
Joint Conference on Information Sciences - Proceedings, Abstracts and Summaries, JCIS 94. 1994. p. 35-38.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - On Fuzzy Regular Languages
AU - Malik, Davender S.
AU - Mordeson, John N.
AU - Sen, M. K.
PY - 1994
Y1 - 1994
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 necessay 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 necessay and sufficient condition for FL∨(M) to be nonconstant.
UR - http://www.scopus.com/inward/record.url?scp=1642341426&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=1642341426&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:1642341426
SP - 35
EP - 38
BT - Joint Conference on Information Sciences - Proceedings, Abstracts and Summaries, JCIS 94
ER -