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 language | English (US) |
|---|---|
| Pages (from-to) | 263-273 |
| Number of pages | 11 |
| Journal | Information sciences |
| Volume | 88 |
| Issue number | 1-4 |
| DOIs | |
| 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
Fingerprint Dive into the research topics of 'On fuzzy regular languages'. Together they form a unique fingerprint.
Cite this
Malik, D. S., Mordeson, J. N., & Sen, M. K. (1996). On fuzzy regular languages. Information sciences, 88(1-4), 263-273. https://doi.org/10.1016/0020-0255(95)00167-0