An efficient linear pseudo-minimization algorithm for Aho-Corasick automata

Abstract

A classical construction of Aho and Corasick solves the pattern matching problem for a finite set of words X in linear time, where the size of the input X is the sum of the lengths of its elements. It produces an automaton that recognizes A * X, where A is a finite alphabet, but which is generally not minimal. As an alternative to classical minimization algorithms, which yields a solution to the problem, we propose a linear pseudo-minimization algorithm specific to Aho-Corasick automata, which produces an automaton whose size is between the size of the input automaton and the one of its associated minimal automaton. Moreover this algorithm generically computes the minimal automaton: for a large variety of natural distributions the probability that the output is the minimal automaton of A * X tends to one as the size of X tends to infinity. © 2012 Springer-Verlag.