KnowraFinite automatonLinked fromLinked fromThe 11 pages that link to Finite automaton, each with the reason it gives.All 11Broader topic 1Related 3Narrower topic 4Compared with 3Regular languageNarrower topic: Regular languages are precisely the languages finite automata recognize.Pumping lemma for regular languagesNarrower topic: A regular language is recognized by a finite automaton, whose bounded states force the repetition.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.