Aspects

Dfa

A DFA is a deterministic finite automaton, a simple model of computation

Nfa

An NFA is a nondeterministic finite automaton, a mathematical model of computation that decides membership in regular languages.

Faster compact powerful

Quality | Example |
---|---|

Faster |
"Generally speaking dfa is faster but nfa is more compact" from question "Parallel regex matching with NFA vs DFA? Which one is faster?" |

Slower |
"Perl uses nfa which is slower yet more powerful than the dfa engine sed has" from question "Is it faster to use alternation than subsequent replacements in regular expressions" "Regex is a nfa and is as such in most cases slower than a dfa or hand-written parser" from question "Rewrite IsHexString method with RegEx" |

Others