Determining the Degree of Fuzzy Regularity of a String
DOI:
https://doi.org/10.51408/1963-0079Keywords:
Fuzzy string matching, Pattern recognition, Fuzzy automatonAbstract
The paper deals with the issue of determining the degree of fuzzy regularity of a crisp string. It is assumed that the concept of fuzzy regularity is formalized by a pattern given as a finite automaton with fuzzy properties of alphabet characters on transitions. Proceeding from this, we replace the problem of determining the degree of fuzzy regularity of a crisp string with the problem of determining the degree of belonging of such a string to the language of the corresponding automaton and propose an effective method for solving it using the dynamic programming approach.
The solution to the considered problem makes it possible to fuzzify the set of strings in a given alphabet based on a pattern defining fuzzy regularity. This work is a continuation of the author’s previous works related to finding occurrences of a fuzzy pattern in the text. It may have applications in the field of pattern recognition, data clustering, bio-informatics, etc.
References
Y. Cao and Y. Ezawa, “Non-determinstic fuzzy automata”, Information Sciences, vol. 191, pp. 86-97, 2012.
J. N. Mordeson and D.S. Malik, Fuzzy Automata and Languages: Theory and Applications, Chapman & Hall, CRC, Boca Raton, London 2002.
R. K. Singh, A. Rani and M.K. Sachan, ”Fuzzy automata: A quantitative review”, International Journal on Future Revolution in Computer Science & Communication Engineering, vol 3, no. 7, pp. 11-17, 2017.
C. M. Bishop, Pattern Recognition and Machine Learning, Springer, 2006.
Wang Zhen Zhou, ”Image segmentation by combining the global and local properties”, Expert Systems with Applications, vol. 87, pp. 30-40, 2017.
Bezdek, James C, Pattern Recognition with Fuzzy Objective Function Algorithms, 1981.
A. Kostanyan, Fuzzy string matching with finite automata, Proc. on 2017 IEEE Conference CSIT-2017, Yerevan, Armenia, pp. 25-29. IEEE Press, USA 2018.
A. Kostanyan, Fuzzy string matching using prefix table, Transactions of IIAP NAS RA, Mathematical Problems of Computer Science, vol. 54, 2020, pp.116 -121.
A. Kostanyan and A. Karapetyan, String Matching in Case of Periodicity in the Pattern, In: Dolinina O., Brovko A., Pechenkin V., Lvov A., Zhmud V., Kreinovich V. (eds) Recent Research in Control Engineering and Decision Making. ICIT 2019. Studies in Systems, Decision and Control, vol 199. Springer, 2019.
A. Kostanyan and A. Harmandayan, Segmentation of string to match a fuzzy pattern, In Proc. of Computer Science & Information Technologies (CSIT) Conference, Yerevan, Armenia, September, pp. 17-19, 2019.
A. Kostanyan and A. Harmandayan, Mapping a fuzzy pattern onto a string, in Proc. On 2019 IEEE Conference ”2019 Computer Science and Information Technologies (CSIT), Yerevan, Armenia, 23-27 Sep., 2019, IEEE Press, USA, pp. 5-8, 2019.
L. A. Zadeh, The concept of a linguistic variable and its application to approximate reasoning-I, Information Sciences, vol. 8, pp. 199-249, 1975.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
