Finite state machines: implementing

How it works:

Assume state 00, input 0

Select ROM address 000, data 0110

Output is 01

Next state is determined by D1 = 1, T0 = 0

Q1 becomes 1 (D input)

Q0 becomes 0 (hold)

Next state is 10

Try other states and inputs