Finite Automaton

Natural & Formal Sciences Dictionary
A mathematical model of computation consisting of a finite set of states, an input alphabet, transition relations, a start state, and one or more accepting states; used to recognize regular languages. Variants include deterministic finite automata (DFA) and nondeterministic finite automata (NFA).