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