Finite Automaton

A finite automaton is a fundamental model of computation. It transitions through a finite set of states, processing input symbols to recognize specific patterns or formal language structures.

See also

• Turing Machine
• Regular Expression
• State Machine
• Computer Science