Clint Hepner wrote: > Strictly speaking, a regular expression is just a string that encodes of a > (non)deterministic finite automata. More strictly speaking, regular expressions themselves are agnostic about determinism vs. non-determinism, since for any NFA you can always find an equivalent DFA. -- Greg