<aside> 🎰 Abstract machine that can be in exactly one of a finite number of states at any given time. Can change from one state to another in response to external inputs, and is defined by a list of its states, initial state, and conditions for each transition.

</aside>

• State: condition at a particular time
• Kernel: memory
• Combinational Circuit:

Approach to the Design

1. Draw the state transition diagram
2. Create the state transition table
3. Encode the states on the state transition table
   1. Derive the logic expression, minimize them
4. Create the output table, encode it
   1. Derive the logic expressions, minimize them
5. Draw the circuit and implement it

Automatic Door Example

• Inputs
  • No person detected → encode = 0
  • Person detected → encode = 1
• States
  • Door open → encode = 1
  • Door closed → encode = 0

State Table

Notice that the next states → same value as inputs

IKEA elevator example

Controller will check the current floor and current input, and transition if needed

1. Can only be on one floor at a time (ground or first)