Week 1 Notes
Introduction
|
|
| Date |
09/06/2022 |
| Topic |
Introduction |
| Professor |
Dr. Hasker |
| Week |
1 |
Introduction (09/06/2022)
Example: Turnstile
- Locked
- Unlocked
- Exception
- Ticket
- Mute
- Release
- Collect
- Eject
- Alarm
Finite state machines
- Have a set of states, where free arrow marks start state
- States have transitions from one to the next
- Events/inputs control which transitions are taken
- State names help understand the machine, but have no meaning
- If no transition out, then machine crashes in an error state and the input is rejected.
- If in final state at end of input, the input is accepted
Consists of Accepted/Rejected states
Lecture II Week I (Wednesday 7th, 2022)
|
|
| Date |
09/07/2022 |
| Topic |
Deterministic Machines |
| Professor |
Dr. Hasker |
| Week |
1 |
Deterministic Machines
- No two transitions out of a state have the same label
Implementing an FSM
State
An identifier + a collection of transitions
- Each transition:
- has a source state
- has a destination state
transition_on:
- take input or event
- change the current state to the transition destination
Success: last reached state is final