Computer Science – Formal Languages and Automata Theory
Scientific paper
2011-02-26
Computer Science
Formal Languages and Automata Theory
42 pages, submitted to Information Sciences
Scientific paper
In our recent paper we have established close relationships between state reduction of a fuzzy recognizer and resolution of a particular system of fuzzy relation equations. In that paper we have also studied reductions by means of those solutions which are fuzzy equivalences. In this paper we will see that in some cases better reductions can be obtained using the solutions of this system that are fuzzy quasi-orders. Generally, fuzzy quasi-orders and fuzzy equivalences are equally good in the state reduction, but we show that right and left invariant fuzzy quasi-orders give better reductions than right and left invariant fuzzy equivalences. We also show that alternate reductions by means of fuzzy quasi-orders give better results than alternate reductions by means of fuzzy equivalences. Furthermore we study a more general type of fuzzy quasi-orders, weakly right and left invariant ones, and we show that they are closely related to determinization of fuzzy recognizers. We also demonstrate some applications of weakly left invariant fuzzy quasi-orders in conflict analysis of fuzzy discrete event systems.
Ćirić Miroslav
Ignjatović Jelena
Stamenković Aleksandar
No associations
LandOfFree
Reduction of fuzzy automata by means of fuzzy quasi-orders does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Reduction of fuzzy automata by means of fuzzy quasi-orders, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reduction of fuzzy automata by means of fuzzy quasi-orders will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-53685