Draw a DFA that accepts the following language over the alphabet {0,1}: the set of all strings that contain a substring of four consecutive symbols exactly two of which are 1. Your DFA must handle all...

Extracted text: Draw a DFA that accepts the following language over the alphabet {0,1}: the set of all strings that contain a substring of four consecutive symbols exactly two of which are 1. Your DFA must handle all input strings in {0,1}*. Here is the best way to approach this problem: 1. Figure out all the final states and label them with the substring that causes the acceptance. Draw them in a line or column in alphanumeric order. 2. Draw the DFA working your way backwards from these final states to the starting state, labelling each intermediate state with the component of the substring recognized so far. This labelling is important in order to not get confused and to be able to work out step 3! 3. Complete the DFA with the missing transitions and states.


Extracted text: Draw a DFA that accepts the following language over the alphabet {0,1}: the set of all strings such that any substring of four consecutive symbols does not have exactly two Os. (Hint: look at the solution of the previous question)