# Question: first give the state diagram for the nfa that recognizes...

###### Question details

First, give the state diagram for the NFA that recognizes the language below using no more than 3 states. Next, use the powerset construction from the proof of Theorem 1.39 in the book to convert the NFA into a DFA. If there are any unneeded states or states that can be combined, you may simplify your DFA, but show your DFA’s state diagram before and after simplification.

Theorem 1.39 states: Every nondeterministic finite automaton has an equivalent deterministic finite automaton

Proof: