> The Thomson NFA quickly gets to be millions of times faster The O(2^n) worst case only comes from highly ambiguous patterns which are better written in other

> The Thomson NFA quickly gets to be millions of times faster The O(2^n) worst case only comes from highly ambiguous patterns which are better written in other ways. So this isn't really accurate in practice.