Linked from

The 11 pages that link to Finite automaton, each with the reason it gives.

• Finite setRelated: Its state space is a finite set, enabling exhaustive analysis.

• Regular expressionRelated: Every regular expression describes a language that some finite automaton recognizes.

• Regular languageNarrower topic: Regular languages are precisely the languages finite automata recognize.

• Pushdown automatonCompared with: Its memory is bounded, unlike the potentially unbounded stack here.

• Samuel EilenbergBroader topic: Finite automata provide the machines whose behavior Eilenberg studied algebraically.

• Presburger arithmeticRelated: Automata can recognize encodings of tuples satisfying Presburger formulas.

• Pumping lemma for regular languagesNarrower topic: A regular language is recognized by a finite automaton, whose bounded states force the repetition.

• Automata theoryCompared with: It contrasts with stack and tape machines whose additional memory expands recognition power.

• Model of computationCompared with: It is strictly less expressive than general-purpose models such as Turing machines.

• Road coloring theoremNarrower topic: A coloring assigns input symbols to edges and thereby defines the automaton in the theorem.

• String-searching algorithmNarrower topic: Some string-searching methods encode pattern progress as states and character transitions.