8. (10 pts) Let M1 and M2 be two DFAs. Show that the following language can also be accepted by a DFA: the set of all words w such that w is accepted by M1 and w is not accepted by M2. (Hint: Structural induction won’t help you.)
HELLO
I AM ADDING ANSWER BELOW
PLEASE GO THROUGH IT ONCE
Get Answers For Free
Most questions answered within 1 hours.