Theory of computation
Regex to NFA
Thompson's construction animated: turn a regular expression into an ε-NFA piece by piece, then test strings and convert it to a DFA.
Theory of computation
Thompson's construction animated: turn a regular expression into an ε-NFA piece by piece, then test strings and convert it to a DFA.