We have a cobination lock with the following descriptions.
A) If you enter the combination '010,' it will open the lock by giving output z=1 otherwise not z=0.
B) We represent this by a non-overlapping sequence detector. In other words, asa soon as you detect the sequence, you will need to get another complete sequence to unlock. Therefore, you need to carefully choose to which state you will need to go after the combination is detcted.
C) For simplicity, we assume that the entries arrive at consecutive clock cycles, so no need to have an idle or do nothing input consideration, that is we have a one-bit input : 0 or 1.
You need to
a) Draw both Mealy and Moore state diagrams. (3 states for Mealy, 4 for Moore)
b) Draw the two corresponding state tables and state assigned tables using binary encoding
c) Draw he minimized two circuits usig D flip-flops through K-maps and tabulate the number of gates and D flip-flops needed for each case.