The digital lock needs to allow for 1 error for each combination. When the 2nd attempt is correct it goes on, if the 2nd attempt is still an error it locks everything until the reset. And when all three digits are entered correctly the lock remains open until reset.

 

We don't do homework here, we help with homework, so please show us your approach at doing this task, and we'll help you from there.

 

I was thinking about using a mealy machine for the state diagram because the transitions are what makes the state change.

 

I was thinking about using a mealy machine for the state diagram because the transitions are what makes the state change.

So... show your best attempt to get as far as you can.

 

Here's what I made.

 

I'm struggling to find out whether another state is necessary or if whether I'm on the right track.

 

How about explaining your state machine as if convincing a client that you have a solution to their problem? What does each state mean? What does each transition mean? Walk through an example (or examples) that exercise each state and each transition at least once.

 

When you say walking through examples do you mean finding some similar problems and compare them.

 

When you say walking through examples do you mean finding some similar problems and compare them.

No. I mean running your proposed machine on examples and show how it works as the user makes various combinations of right and wrong choices. At each step, indicate the transition and what state the machine goes to.

 

I think this describes pretty decently how the lock is intended to work. Let me know what you think of it thanks.