Fuzzy string matching with finite automat

Abstract

The string matching problem is one of the widely-known symbolic computation problems having applications in many areas of artificial intelligence. The most famous algorithms solving the string matching problem are the finite automata method, Knuth-Morris-Pratt and Rabin-Karp's algorithms. In this paper we focus on applying the finite automata method to find a fuzzy pattern in a text.