What is a finite automaton?
Published in
Mar 26, 2022
Idea
A Finite Automaton (FA) aka Finite-State Machine (FSM) is a simple mathematical machine; it is a representation of how computations are performed with limited memory space.
It is a model of computation, which consists of a set of states that are connected by transitions. It has inputs and outputs (Reject or Accept).
Five-tuple = is a sequence of five elements
- Q (uppercase q),
- ∑,
- δ (delta),
- q₀ ∈ Q, ∈ (element of)
- F (uppercase f), F ⊆ Q, a set of accepting states
