4 ms·
Suffix Trees. That kind of hyper efficient recognition is even harder to think about without the finite automata theory behind regular expressions.
by jmount 13y ago
Suffix Trees. That kind of hyper efficient recognition is even harder to think about without the finite automata theory behind regular expressions.
- crb002 13y agoI posted this above. Micron is releasing a new NFA card http://www.micron.com/about/innovations/automata-processing http://www.micron.com/about/innovations/automata-processing Any guess on which formerly expensive NFA algorithms will be put to use on it in short order?