Ben Bitdiddle is exploring finite-state machines of the following form:
A. Draw a state-transition diagram for the FS . Assume that you start in the state Q0 = 0, output = 1.
B. Assume that you start in the state Q0 = 0, Output = 0. Does there exist an equivalent three-state finite-state machine?
C. Ben has also been experimenting with finite-state machines of the form shown below, where F is an arbitrary two-input tow many different (nonequivalent) finite-state machines can he generate this way?
