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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.