Question: Use the procedure you described in Exercise I and the finite-state automata you constructed in Exercise II to find a deterministic finite-state automaton that recognizes the set of all bit strings that do not contain the string 101.
Exercise II: Construct a deterministic finite-state automaton that recognizes the set of all bit strings that contain the string 101.
Exercise I: Explain how you can change the deterministic finite-state automaton M so that the changed automaton recognizes the set I ∗ - L(M).