FIXED POINT THEOREMS ON INTUITIONISTIC FUZZY QUASI-METRIC SPACES WITH APPLICATION TO THE DOMAIN OF WORDS

Abstract

In this paper, we prove intuitionistic fuzzy quasi-metric version of the Banach contraction principle which extend the famous Grabiec fixed point theorem.  By using this result we show the existence of fixed point for contraction mappings on the domain of words and apply this approach to deduce the existence of solution for some recurrence equations associated to the analysis of Quicksort algorithms and divide and Conquer algorithms, respectively.