6 a Each clock cycle an input is provided to the finite stat

6. (a) Each clock cycle, an input is provided to the finite state machine (FSM) below. Assuming that we start at state 00 and given an input for each tick, fill in the table to show the next state.

(b) What bit sequence(s) does this FSM recognize? Your answer should be a string of bits (ex. “01” or “1110”).

11 0- 10 00 01 Time 0 1 2 3 4 5 6 input START 1 0 0 1 1 0 1 0 State 00

Solution

a)

b) Since there are no final state marked in the FSM, hence it does not recognises any string

0	0	1	2	3	4	5	6	7	8
Input	Start	1	0	0	1	1	0	1	0
State	00	01	10	00	01	11	11	10	00