In: Computer Science
Consider the language L over alphabets (a, b) that produces
strings of the form aa* (a + b) b*a.
a) Construct a nondeterministic finite automata (NFA) for the
language L given above.
b) Construct a deterministic finite automaton (DFA) for the NFA you have constructed above.