‎a new method for the defuzzification of fuzzy numbers is developed in this paper. it is well-known, defuzzification methods allow us to find aggregative crisp numbers or crisp set for fuzzy numbers. but different fuzzy numbers are often converted into one crisp number. in this case the loss of essential information is possible. it may result in inadequate final conclusions, for example, expert...

0

‎A new method for the defuzzification of fuzzy numbers is developed in this paper. It is well-known, defuzzification methods allow us to find aggregative crisp numbers or crisp set for fuzzy numbers. But different fuzzy numbers are often converted into one crisp number. In this case the loss of essential information is possible. It may result in inadequate final conclusions, for example, expert...

We aim here at obtaining bounds on the first nonzero eigenvalue for selfadjoint boundary value problems on a weighted network by means of equilibrium measures, that include the study of Dirichlet, Neumann and Mixed problems. We also show the sharpness of these bounds throughout the analysis of some examples. In particular we emphasize the case of distance-regular graphs and we show that the obt...

We introduce a new technique for constructing a finite state deterministic automaton from a regular expression, based on the idea of marking a suitable set of positions inside the expression, intuitively representing the possible points reached after the processing of an initial prefix of the input string. Pointed regular expressions join the elegance and the symbolic appealingness of Brzozowsk...

We introduce weighted regular tree grammars with storage as combination of (a) regular tree grammars with storage and (b) weighted tree automata over multioperator monoids. Each weighted regular tree grammar with storage generates a weighted tree language, which is a mapping from the set of trees to the multioperator monoid. We prove that, for multioperator monoids canonically associated to par...