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 3Pushdown automatonCompared with: Its memory is bounded, unlike the potentially unbounded stack here.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.