Negation in Thompson's algorithm?
<p>I was reading this for learning how to write state machines for regular expressions</p>

<p><a href="https://en.wikipedia.org/wiki/Thompson%27s_construction" rel="nofollow">https://en.wikipedia.org/wiki/Thompson%27s_construction</a></p>

<p>However I only see things like union, concatenation, Kleene star, but nothing on negation, which is mentioned here</p>

<p><a href="https://en.wikipedia.org/wiki/Nondeterministic_finite_automaton#Closure_properties" rel="nofollow">https://en.wikipedia.org/wiki/Nondeterministic_finite_automaton#Closure_properties</a></p>

<p>What would the construction be for that?</p>