4. Design the minimum-state DFA that accepts all and only the strings of O's and 1's that end in 010. To verify that you have designed the correct automaton, we will ask you to identify the true statement in a list of choices. These choices will involve: 1. The number of loops (transitions from a state to itself). 2. The number of transitions into a state (including loops) on input 1. 3. The number of transitions into a state (including loops) on input 0. Count the number of transitions into each of your states ("in-transitions") on input 1 and also on input 0. Count the number of loops on input 1 and on input 0. Then, find the true statement in the following list. a) There is one loop on input 1 and no loop on input 0. b) There is one state that has three in-transitions on input 0. c) There is one state that has one in-transition on input 1. d) There is one state that has two in-transitions on input 0. 1. Here is the transition table of a DFA: 01 →AED *BAC CGB DEA *EHC FCB GFE HBH Find the minimum-state DFA equivalent to the above. Then, identify in the list below the pair of equivalent states (states that get merged in the minimization process). ○ a) C and F b) G and H c) C and Ꭰ d) F and H 2. Design the minimum-state DFA that accepts all and only the strings of O's and 1's that have 110 as a substring. To verify that you have designed the correct automaton, we will ask you to identify the true statement in a list of choices. These choices will involve: 1. The number of loops (transitions from a state to itself). 2. The number of transitions into a state (including loops) on input 1. 3. The number of transitions into a state (including loops) on input 0. Count the number of transitions into each of your states ("in-transitions") on input 1 and also on input 0. Count the number of loops on input 1 and on input 0. Then, find the true statement in the following list. a) There are three states that have one in-transition on input 1. b) There is one state that has two in-transitions on input 1. c) There are two states that have no in-transitions on input 1. d) There is one state that has two in-transitions on input 0. 3. Here is the transition table of a DFA that we shall call M: 01 ABG BCH *CDG *DAH EFC FGI *GHC *HAD IEI Find the minimum-state DFA equivalent to the above. States in the minimum-state DFA are each the merger of some of the states of M. Find in the list below a set of states of M that forms one state of the minimum-state DFA. a) {C,G} b) {A, B} c) {B,F} d) {A,F}

4. Design the minimum-state DFA that accepts all and only the strings of O's and 1's that end in 010. To verify that you have designed the correct automaton, we will ask you to identify the true statement in a list of choices. These choices will involve: 1. The number of loops (transitions from a state to itself). 2. The number of transitions into a state (including loops) on input 1. 3. The number of transitions into a state (including loops) on input 0. Count the number of transitions into each of your states ("in-transitions") on input 1 and also on input 0. Count the number of loops on input 1 and on input 0. Then, find the true statement in the following list. a) There is one loop on input 1 and no loop on input 0. b) There is one state that has three in-transitions on input 0. c) There is one state that has one in-transition on input 1. d) There is one state that has two in-transitions on input 0. 1. Here is the transition table of a DFA: 01 →AED BAC CGB DEA EHC FCB GFE HBH Find the minimum-state DFA equivalent to the above. Then, identify in the list below the pair of equivalent states (states that get merged in the minimization process). ○ a) C and F b) G and H c) C and Ꭰ d) F and H 2. Design the minimum-state DFA that accepts all and only the strings of O's and 1's that have 110 as a substring. To verify that you have designed the correct automaton, we will ask you to identify the true statement in a list of choices. These choices will involve: 1. The number of loops (transitions from a state to itself). 2. The number of transitions into a state (including loops) on input 1. 3. The number of transitions into a state (including loops) on input 0. Count the number of transitions into each of your states ("in-transitions") on input 1 and also on input 0. Count the number of loops on input 1 and on input 0. Then, find the true statement in the following list. a) There are three states that have one in-transition on input 1. b) There is one state that has two in-transitions on input 1. c) There are two states that have no in-transitions on input 1. d) There is one state that has two in-transitions on input 0. 3. Here is the transition table of a DFA that we shall call M: 01 ABG BCH CDG DAH EFC FGI GHC HAD IEI Find the minimum-state DFA equivalent to the above. States in the minimum-state DFA are each the merger of some of the states of M. Find in the list below a set of states of M that forms one state of the minimum-state DFA. a) {C,G} b) {A, B} c) {B,F} d) {A,F}