The Banach fixed point theorem in fuzzy quasi-metric spaces with application to the domain of words

We present a fuzzy quasi-metric version of the Banach contraction principle, which constitutes an extension of 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 when it is endowed with certain fuzzy quasi-metrics of Baire type. We apply this approach to deduce the existence of solution for some recurrence equations associated to the analysis of Quicksort algorithms and Divide & Conquer algorithms, respectively.