The aim of this paper is to prove a common fixed point theorem for nonexpansive type single valued mappings which include both continuous and discontinuous mappings by relaxing the condition of continuity by weak reciprocally continuous mapping. Our result is generalize and extends the corresponding result of Jhade et al. [P.K. Jhade, A.S. Saluja and R. Kushwah, Coincidence and fixed points of ...

‎recently‎, ‎hussain et al.‎, ‎discussed the concept of $wt$-distance on a‎ ‎metric type space‎. ‎in this paper‎, ‎we prove some fixed‎ ‎point theorems for classes of contractive type multi-valued operators‎, ‎by using $wt$-distances in the setting of a complete metric type space‎. ‎these results generalize a result of feng and liu on multi-valued operators.

In this paper, we introduce a new class of set-valued mappings which is called MD-type mappings. This class of mappings is a set-valued case of a class of the D-type mappings. The class of D-type mappings is a generalization of nonexpansive mappings that recently introduced by Kaewkhao and Sokhuma. The class of MD-type mappings includes upper semi-continuous Suzuki type mappings, upper semi-con...

in this paper, we present a revised similarity measure based onchen-and-chen's similarity measure for fuzzy risk analysis. the revisedsimilarity measure uses the corrected formulae to calculate the centre ofgravity points, therefore it is more  effective than the chen-and-chen'smethod. the revised similarity measure can overcome the drawbacks of theexisting methods. we have also proposed a new ...

In this paper, we improve some recent coupled fixed point resultsfor single-valued operators in the framework of ordered $b$-metricspaces established by Bota et al. [M-F. Bota, A. Petrusel, G.Petrusel and B. Samet, Coupled fixed point theorems forsingle-valued operators in b-metric spaces, Fixed Point TheoryAppl. (2015) 2015:231]. Also, we prove that Perov-type fix...

In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued)  regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...