From: johnl@taugh.com   
      
   The easiest way to implement regular expressions is to turn them into   
   NFAs, but that has well known problems that if you feed hostile input   
   to the NFAs, they can take exponential time and it's a way to DDoS the   
   server. If you translate the NFA to a DFA it runs in linear time, but   
   if the regex is ambiguous, as many are, the DFA may match something   
   different from the NFA.   
      
   This paper on the Arxiv preprint server proposes some rather complex   
   tweaks to NFA regex matching to fix many performance issues while giving   
   the same answers as before.   
      
   https://arxiv.org/abs/2401.12639   
      
   Regards,   
   John Levine, johnl@taugh.com, Taughannock Networks, Trumansburg NY   
   Please consider the environment before reading this e-mail. https://jl.ly   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)