Reminder:
An automata is a mathematical model of a machine that can be in one of a finite number of states at any given time. One famous example of an automata is Turing's machine, which is a theoretical model of computation that can simulate any algorithmic process.
Examples of Automata:
- Finite State Machines (FSM)
- Cellular Automatas (CA), Conway's Game of Life.
- Turing Machines (TM)