Pattern matching is a component of many information retrieval problems. We deal with searching for a set of patterns. The following generalizations of the problem are considered on the same basis: 1) searching for the set of patterns by a partially-specified query of large cardinality; 2) revealing the coincidences, insertions arid intersections of patterns in the query; 3) searching for close “patterns” in the text (approximate string matching). The algorithms for solving the above problems using deterministic and nondeterministic finite automata oriented to personal medium-speed computers have been proposed. The algorithms have been tested on searching for a real set of patterns.