Hello, I think I have known the general rules to how to convert an NFA to a DFA, but only the NFAs have sufficient transitions. So for example, the alphabet = {0, 1}, and from the start state q0, there are transitions 0 to one ore more states; and there are transitions 1 to other state(s). But when it comes to a NFA that is lack of transitions from one of a symbols, I do not know how to convert it to a DFA. For example, in the NFA M1 and NFA M2, there is no 1-transition from q0, and no 0-transition from q1. NFA M1 : NFA M2:.