From: wyrmwif@tsoft.org   
      
   haberg@math.su.se (Hans Aberg) wrote:   
   # Can the intersection of two regular expression languages be   
   # constructed as a regular expression language?   
      
   Type 3 languages are closed under intersection, so it is possible.   
   I don't recall offhand, but I think it might just be the intersection   
   of the state graphs. Convert the REs to DFAs, work with the graphs,   
   and then you can convert DFAs back to REs.   
      
   --   
   SM Ryan http://www.rawbw.com/~wyrmwif/   
   Haven't you ever heard the customer is always right?   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)