1. In a computing environment, a method performed at least in part on at least one processor, comprising processing a regular expression or pattern into a symbolic finite automaton, including labeling a transition by a formula representing a set of characters corresponding to a character range.