Algorithmic complexity of matches
by Bobby Martin
Is there a way to configure Hyperscan to use only DFA state machines, or
otherwise restrict the time complexity of matches to be polynomial at worst?
We need to ensure the algorithmic complexity of our matches doesn't go
exponential in the size of the searched string, as NFA can for degenerate
cases
We understand that this is incompatible with some regular expression
features such as backreferences.
Thanks!
Bobby
3 years, 3 months
