Marek Perkowski

1. (5 points). Find an optimum state assignment of the machine from Fig. 1. Do not realize or minimize the machine. Only write how codes are are assigned to states. Explain what you do. Show stages. Any method is good but needs explanation.
   
   FIG. 1
   
   
2. (5 points). Find a state machine with minimum number of states, equivalent to one from Fig. 2. Do not find assignment or realization. Any method is good but show all stages.
   
   FIG. 2
   
   
3. (5 points). Find a realization with T flip-flops and NOR gates of the machine from Fig. 3. Do not do state minimization or state assignment.
   
   FIG. 3
   
   
4. (5 points). Find a table of an iterative circuit that gives value "one" on the output is the number of inputs equal one exceeds two, in other words, if more than two of its inputs are "1". Otherwise the output is "0". Assume arbitrary number of inputs.