On Two-Dimensional Approximate Pattern Matching Using Fuzzy Automata

Pattern matching has been extensively studied in the last few decades, owing to its great contribution in various fields such as search engines, computational biology, etc. Several real-life situations require patterns that allow ambiguity in specified positions. In this paper, one-dimensional and two-dimensional approximate pattern matching models have been constructed using fuzzy automata. The similarity function used in fuzzy automata enables the occurrence of all exact and similar one-dimensional and two-dimensional patterns. This kind of searching approximate patterns is not possible with regular search models. The time complexity of the proposed algorithm has also been analyzed.