An FSA (Finite state automation) is a set of nodes with directions on how to go between them.

It is made using:

  • An input alphabet (letters or strings which are legal inputs).
  • A set of transition rules to move between nodes

When there is an arrow that points to itself, it means that it is an optional. That means that it can occur as many times as