Define a finite automaton (FA)

A Finite Automaton (FA), also known as a finite state machine, is a mathematical model of computation used to represent and analyze systems with a finite number of states. It is a fundamental concept in automata theory and formal languages, useful for tasks like pattern recognition and language processing.