Andrew Koenig <ark at research.att.com> wrote: ... > Because in general, the intersection of two regular expressions is not > a regular expression, in the sense that it cannot generally be represented > by a regular grammar or parsed efficiently by a finite automaton. I believe you're incorrect about this. Regular languages are closed over intersection.