(Theory of Computation)

Draw DFAs (!) for the following languages over sigma = {a, b} - the expressions on the right-hand side are Regular Expressions: L_1 = ab L_2 = a Based on this draw a DFA for L_3 = (ab)* Based on your automata for L_2 and L_3 construct an epsilon-NFA for the RE (ab)* Unity a Transform this epsilon-NFA into an equivalent DFA