Finite automaton

A finite automaton is a simple mathematical model used to recognize patterns or classify sequences, like strings of characters. It consists of a finite number of states, including starting and accepting states, and rules (transitions) that determine how it moves from one state to another based on input symbols. Think of it like a machine that reads a sequence one symbol at a time, changing its internal condition accordingly. If, after processing the entire sequence, it ends in an accepting state, the automaton recognizes or accepts that pattern; otherwise, it rejects it.