The objective of this paper is to characterize the quotient structures of fuzzy multiset finite automata. We introduce different congruence relation on multiset associated with fuzzy multiset finite automata and show that each congruence relation associates a semigroup with the fuzzy multiset finite automata. We also discuss the charaterization of fuzzy multiset finite automata by defining an admissible relation.
The concept of recognizability of a fuzzy language by crisp deterministic fuzzy automaton and monoid is well known. The purpose of the present work is to study the recognizability of fuzzy languages by fuzzy ordered monoids. We show that the upper sets of a given fuzzy ordered monoid play a nice role in such studies. Also, we introduce the syntactic fuzzy ordered monoid of an upper set which recognizes this upper set.
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.