Ben Bitdiddle is exploring finite-state machines of the following form:
![173_440f0558-4fdf-4ef6-9215-7bf028ffa467.png](https://secure.tutorsglobe.com/CMSImages/173_440f0558-4fdf-4ef6-9215-7bf028ffa467.png)
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?
![982_f02750eb-c8f5-4da7-9de3-0939eb8f7db9.png](https://secure.tutorsglobe.com/CMSImages/982_f02750eb-c8f5-4da7-9de3-0939eb8f7db9.png)