In this paperwe adapt thewell-knownBrzozowskideterminizationmethod to fuzzy automata. Thismethod gives better results than all previously knownmethods for determinization of fuzzy automata developed by Bělohlávek [InformSciences 143 (2002)205–209],Li andPedrycz [FuzzySet Syst 156 (2005)68–92], Ignjatović et al. [Inform Sciences 178 (2008) 164–180], and Jančić et al. [Inform Sciences 181 (2011) ...

In the literature on social choice with fuzzy preferences, a central question is how to represent the transitivity of a fuzzy binary relation. Arguably the most general way of doing this is to assume a form of transitivity called max-star transitivity. The star operator in this formulation is commonly taken to be a triangular norm. The familiar max-min transitivity condition is a member of this...

This papers aims at clarifying the meaning of diierent interpretations of the Max-Min or, more generally, the Max-t-norm rule in fuzzy systems. It turns out that basically two distinct approaches play an important role in fuzzy logic and its applications: fuzzy interpolation on the basis of an imprecisely known function and logical inference in the presence of fuzzy information .

In the literature on social choice with fuzzy preferences, a central question is how to represent the transitivity of a fuzzy binary relation. Arguably the most general way of doing this is to assume a form of transitivity called max-star transitivity. The star operator in this formulation is commonly taken to be a triangular norm. The familiar max-min transitivity condition is a member of this...

Automata are the prime example of general computational systems over discrete spaces. The incorporation of fuzzy logic into automata theory resulted in fuzzy auotomata which can handle continuous spaces. Moreover, they are able to model uncertainty which is inherent in many applications. Deterministic Finite-state Automata (DFA) have been the architecture, most used in many applications, but, t...

This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...