Abstract
Noticing that ordinary metrics do not present an adequate tool for the study of analytic problems of word combinatorics, as well as in the research of some problems related to theoretical computer science, we propose to use fuzzy metrics in this type of problems. Specifically, the so-called strong fuzzy metric seems to be more appropriate here. In the first part of the paper, we study some special classes of strong fuzzy metrics, topological and lattice properties of certain families of strong fuzzy metrics, and, more generally, strong k-fuzzy metrics. Noticing that one of the standard axioms of a strong fuzzy metric can be easily violated when applied in real situations, in the second part of the paper we introduce more general, approximating fuzzy metrics and illustrate their applicability with some numerical examples.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference32 articles.
1. Probabilistic Geometry
2. Statisitcal metric spaces;Schweizer;Pac. J. Math.,1960
3. Fuzzy metrics and statistical metric spaces;Kramosil;Kybernetika,1975
4. Fixed points in fuzzy metric spaces
5. On some results in fuzzy metric spaces
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献