General automata are considered with respect to normal-ization over semirings. Possibilistic automata are deened as normal pessimistic fuzzy automata. Possibilistic automata are analogous to stochas-tic automata where stochastic (+=) semirings are replaced by possi-bilistic (_=^) semirings; but where stochastic automata must be normal, fuzzy automata may be (resulting in possibilistic automata)...

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) ...

Bisimulations have beenwidely used inmany areas of computer science tomodel equivalence between various systems, and to reduce the number of states of these systems, whereas uniform fuzzy relations have recently been introduced as a means to model the fuzzy equivalence between elements of two possible different sets. Here we use the conjunction of these two concepts as a powerful tool in the st...