You are given 2 DFAs Mi (Q1, 2, 81,910, F1) and M2 = (Q2, 2, 82, 920, F2). We want to construct a DFA M = (0,2,0,90, F) recognizing the concatenation L(M1) - L(M2). One solution would be as follows. Connect each accept state of M to the start state of M2 by an e-move, and make the accept states of My non-accepting. This is an NFA N = (Q', 2, 8', do, F') accepting L(Mi) L(M2). Now transform this NFA into an equivalent DFA. If |Q1] = k and Q2] = k2, then 2k+k2 would be an obvious upper bound on the number of states of such a DFA M. We can actually do much better, because many states of the DFA M obtained with the full subset construction are not reachable from the start state. (a) Identify a large subset of the power set of Q' that are states of M not reachable from the start state. (b) Give a good upper bound on the number of reachable states of the DFA M? You are given 2 DFAs Mi (Q1, 2, 81,910, F1) and M2 = (Q2, 2, 82, 920, F2). We want to construct a DFA M = (0,2,0,90, F) recognizing the concatenation L(M1) - L(M2). One solution would be as follows. Connect each accept state of M to the start state of M2 by an e-move, and make the accept states of My non-accepting. This is an NFA N = (Q', 2, 8', do, F') accepting L(Mi) L(M2). Now transform this NFA into an equivalent DFA. If |Q1] = k and Q2] = k2, then 2k+k2 would be an obvious upper bound on the number of states of such a DFA M. We can actually do much better, because many states of the DFA M obtained with the full subset construction are not reachable from the start state. (a) Identify a large subset of the power set of Q' that are states of M not reachable from the start state. (b) Give a good upper bound on the number of reachable states of the DFA M