I'm very interested in implementing a NFA->DFA module(does that mean a Thompson automaton?) so that the exponential searching algorithm can be reduced to a linear state transition(though the states may be potentially exponential) loop. I can't understand how some language dare use a search algo as a final solution :)
On Wed, Apr 24, 2013 at 4:30 PM, Florian Weimer <fwei...@redhat.com> wrote: > On 04/23/2013 07:21 PM, Tim Shen wrote: >> >> I've made a proposal under the guide of application. Is it detailed >> and realistic? > > > Out of curiosity, do you plan to use a Thompson automaton where possible, or > just NFAs throughout? > > -- > Florian Weimer / Red Hat Product Security Team -- Tim Shen
