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/Territory | United States |
| City | Pinehurst, NC |
| Period | 11/1/94 → 11/1/94 |
All Science Journal Classification (ASJC) codes
- Computer Science(all)