Determinization of fuzzy finite automata is understood here as a procedure of their conversion into equivalent crisp-deterministic fuzzy automata, which can be viewed as being deterministic with possible infinitely many states, but with fuzzy sets of terminal states. Particularly, significant determinization methods are those that provide a minimal crisp-deterministic fuzzy automaton equivalent to the original fuzzy finite automaton called canonization methods. One canonization method for fuzzy finite automata, the Brzozowski type determinization, has been developed recently by Jancic and Ciric in [10]. Here we provide another canonization method for a fuzzy finite automaton A = (A, σ, δ, r) over a complete residuated lattice £, based on the degrees of inclusion of the right fuzzy languages associated with states of A into the left derivatives of the fuzzy language recognized by A. The proposed procedure terminates in a finite number of steps, whenever the membership values taken by δ, σ, and r generate a finite subsemiring of the semiring reduct of £. This procedure is generally faster than the Brzozowski type determinization, and if the basic operations in the residuated lattice £ can be performed in constant time, it has the same computational time as all other determinization procedures provided in [8], [11], and [12].
For almost fifty years, the concept of fuzzy analytic hierarchy process based on triangular fuzzy numbers, supplied with various types of membership functions has experienced a wide variety of Intuitionistic fuzzy numbers, z-Numbers, and Spherical fuzzy numbers. This paper aims to upgrade the concept of Spherical Fuzzy Sets considering the hesitancy, its third coordinate, as a function instead of constant. This broads the decision-makers "spectrum" allowing them to describe the fuzzy part of data more comprehensively. As a path distance between two fuzzy sets, we used geodesic lines in place of great circles, connecting Fuzzy logic with Differential geometry. Also, we proved some algebraic properties concerning associativity and neutral elements for operations ? and ?, for the defined Surface Fuzzy Sets. Additionally, the application of Surface Fuzzy Sets to within AHP is used for ranking Security, Privacy, and Authority sub-criteria affecting B2C e-commerce websites.
In the present paper, we study fuzzy multimodal logics over complete Heyting algebras and Kripke models for these logics. We introduce two types of simulations (forward and backward) and five types of bisimulations (forward, backward, forward-backward, backward-forward and regular) between Kripke models, as well as the corresponding presimulations and prebisimulations, which are simulations and bisimulations with relaxed conditions. For each type of simulations and bisimulations an efficient algorithm has been provided that works as follows: it computes the greatest presimulation/prebisimulation of that type, and then checks whether it meets the additional condition: if it does, then it is also the greatest simulation/ bisimulation of that type, otherwise, there is not any simulation/bisimulation of that type. The algorithms are inspired by algorithms for checking the existence and computing the greatest simulations and bisimulations between fuzzy automata. We also demonstrate the application of these algorithms in the state reduction of Kripke models. We show that forward bisimulation fuzzy equivalences on the Kripke model provide reduced models equivalent to the original model concerning plus-formulas, backward bisimulation fuzzy equivalences provide reduced models equivalent concerning minus-formulas, while regular bisimulation fuzzy equivalences provide reduced models equivalent concerning all modal formulas.
In this paper we introduce two types of simulations and five types of bisimulations for fuzzy social networks, and we study one of them – regular bisimulations. We prove that if there exists at least one regular bisimulation between two fuzzy networks, then there exists the greatest bisimulation of this type, and we provide a procedure for testing the...