[EN] We analyze the complexity of an expoDC algorithm by deducing the existence of solution for the recurrence inequation associated to this algorithm by means of techniques of Denotational Semantics in the context of fuzzy quasi-metric spaces. The fuzzy quasi-metrics provide an additional parameter "t" such that a suitable use of this ingredient gives rise to extra information on the involved computational process. This analysis is done by means of a fuzzy quasi-metric version of the Banach contraction principle on a space of partial functions endowed by a suitable adaptation of the Baire quasi-metric.This research is supported by the Ministry of Economy and Competitiveness of Spain, Grant MTM2012-37894-C02-01 and by Universitat Politecnica de Valencia, Grant PAID-06-12-SP20120471.Tirado Peláez, P. (2014). A new model based on a fuzzy quasi-metric type Baire applied to analysis of complexity. Journal of Intelligent and Fuzzy Systems. 27:2545-2550. https://doi.org/10.3233/IFS-141228S254525502