Linked from

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

• Finite-state machineBroader topic: It makes the input-to-transition rule uniquely determined.

• Regular languageBroader topic: It recognizes a regular language by following a unique state path.

• Deterministic algorithmBroader topic: It is a simple, explicit example of deterministic computation.

• Finite automatonBroader topic: Its single possible computation makes acceptance direct to test.

• Transition functionBroader topic: Its transition function makes every input determine a unique next state.

• Pumping lemma for regular languagesBroader topic: Its unique run makes the repeated-state proof of the lemma especially direct.

• State machineBroader topic: It makes input-driven state changes uniquely predictable.

• Deterministic systemBroader topic: It provides a discrete example where current state and input uniquely fix the next state.