This core generates a deterministic finite automaton from regular expressions. It applies Thompson's Construction as described in the paper "Programming Techniques: Regular expression search algorithm" by Ken Thompson followed by Subset Construction and Hopcroft's Algorithm as described in the paper "AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON" by John Hopcroft.