Minimization of fuzzy finite automata
DS Malik, JN Mordeson, MK Sen - Information Sciences, 1999 - Elsevier
DS Malik, JN Mordeson, MK Sen
Information Sciences, 1999•Elsevier… In this paper we show that a fuzzy finite automation M 1 has an equivalent minimal fuzzy
finite automation M. We also show that M can be chsen so that if M 2 is equivalent to M 1 ,
then M is a homomorphic image of M 2 . … As the state minimization problem for fuzzy finite
automata, as well as for nondeterministic ones, is computationally hard (PSPACE-complete [35,37,69]),
it is not required that this equivalent automaton is minimal, but it is necessary that it is
effectively computable. From different aspects, the state reduction for fuzzy automata was …
finite automation M. We also show that M can be chsen so that if M 2 is equivalent to M 1 ,
then M is a homomorphic image of M 2 . … As the state minimization problem for fuzzy finite
automata, as well as for nondeterministic ones, is computationally hard (PSPACE-complete [35,37,69]),
it is not required that this equivalent automaton is minimal, but it is necessary that it is
effectively computable. From different aspects, the state reduction for fuzzy automata was …
In this paper we show that a fuzzy finite automation M1 has an equivalent minimal fuzzy finite automation M. We also show that M can be chsen so that if M2 is equivalent to M1, then M is a homomorphic image of M2.
Elsevier
Showing the best result for this search. See all results