Skip to main content

Home/ linguistics/ Group items tagged regexp

Rss Feed Group items tagged

anonymous

Regular Expression Matching Can Be Simple And Fast (with NFAs) - 1 views

  •  
    Thompson NFA (Nonfinite State Automata) perform way faster with longer regular expressions than those algorithms used in scripting languages
1 - 1 of 1
Showing 20 items per page