A regular expressions parser that uses a deterministic finite automata, rather than the more common non-deterministic finite automata utilized by most regexp engines. This give assured per-character processing time, and is ideal for cases where the regular expression needs a small amount of state per string, and rarely changes. This is ideal for firewalls and intrusion detection.