Theory of Computation

Problem $2$: Regular expression to NFA to DFA conversion:

Show a problem that describes the process of taking a unique regular expression, converting that regular expression to an NFA, then converting the NFA into a DFA. Your regular expression must have at minimum two unions, two concatenations, and two Kleene star operations. As performed in class, concatenations of single characters can be condensed.

Your problem should describe the regular expression with both processes to convert the regular expression to an NFA and the conversion of that NFA into a DFA.