(Design Problem) Now consider the door combination lock example discussed in Section 1.4.2. This implementation enters an error state as soon as an incorrect bit is entered. This could make it an exceedingly easy lock to pick if this were observable at the lock. Change the design so all three combination bits must be entered before an error state is entered.
(a) Draw a revised state diagram for your revised design.
(b) How many states does your design now have? Write down you state table.
(c) Choose a state encoding and describe the rationale behind your choice. Write down your encoded state table.
(d) Consider the output function for Open. What was the Boolean equation for the original implementation as described in class? What is the Boolean equation for your implementation? How does its complexity compare with original?