Question $1.$ In homework $2$ you implemented a machine that would produce the mod $3$ output for an input stream of bits representing a binary value. As part of that assignment you were asked to think about how the machine would return to the initial state once the completed binary value was provided.

Once possible solution is to have a valid signal that comes along side the bits of input. The idea is that the machine will move through appropriate states based on the input so long as the valid signal is asserted. Once the valid signal is de$-$asserted then the machine would return to the initial state.

A state diagram for this functionality can be seen below. Notice the legend, the $2-$bit quantities on the arcs represent the value of valid followed by the value of A$.$ E$.$g$.10$ means that valid is high and A is low, and x$0$ mea