We extend Baker's theory of parameterized string matching (1993) to al
gorithms that match multiple patterns in a text. We first consider the
case where the patterns are fixed and preprocessed once, and then the
case where the pattern set can change by insertions and deletions. Ba
ker's algorithms are based on suffix trees, whereas ours are based on
pattern matching automata.