| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 391233 | Fuzzy Sets and Systems | 2006 | 9 Pages |
Abstract
Fuzzy language recognizability via finite monoids (called m-recognizability) is examined. Fuzzy languages computed by (max, min)-automata, (max,▵L)-automata and (max,▵D)-automata are m-recognizable (▵L,▵D are the Lucasiewicz intersection and the drastic intersection, respectively). The syntactic monoid associated to each m-recognizable language can be effectively constructed. Thus, the equality of two m-recognizable fuzzy languages is decidable. A pumping lemma is displayed.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
