Overview:

You will create a finite state machine diagram, and submit the following:

A diagram of the states that you have created, including the start state

Names of the states

The transitions between the states $($directed arrows between states$)$

The conditions for the transitions between the states $($e$.$g$.$ if$...$else conditions$)$

What occurs in the state $($basic description$)$

Important:

Much of the marking will be based on originality $($uniqueness of your approach$)$ and completeness $($ensuring that you cover all of the above points and specifications$).$

Use your imagination, and if you want to diverge from the assigned project, it should be acceptable $($ensure that you discuss any major changes with your instructor beforehand$).$

You may work in groups of up to two for this project. You may also work in groups of $3,$ but much higher quality work is expected.

You will be assigned to one of the versions of this project on a first$-$come$-$first$-$served basis. Keep in mind that the states are not fully described and$/$or not all of the states$/$conditions are

given. You must also include the implicit stated or 'common sense' states to complete the full state machine.

Requirements:

A household electronic key lock uses $4$ numbers to unlock a door.

After each number is entered, the number is checked against the allowed number.

if the entered key matches the allowed number, the next number is allowed to be entered.

If the key does not match, the lock is reset.

If the numbers are entered wrong t three times in a row, the lock is disabled for $5$ minutes before allowing keys to be entered again and a message is displayed on the LCD.Display a countdown timer on the LCD to indicate how many minutes are left before the lock is

re$-$enabled again.

If all of the numbers are entered correctly, the lock is opened and a message is indicated on the LCD.

Once the lock is opened and the door is reclosed, the lock is reset, and a message is indicated on the LCD.