Linked from

The 11 pages that link to Transition function, each with the reason it gives.

• Turing machineBroader topic: It specifies each permitted step of the machine.

• Universal Turing machineRelated: The simulator consults the encoded transition rules to determine each simulated step.

• Pushdown automatonRelated: It specifies state changes, input consumption, and stack operations.

• Deterministic finite automatonBroader topic: It formalizes the automaton’s requirement to choose exactly one next state.

• Finite automatonRelated: It encodes how each input symbol changes the automaton's state.

• Vector bundleRelated: Transition functions specify how local product descriptions fit together.

• State machineBroader topic: It specifies how an input changes the machine's state.

• Nondeterministic Turing machineRelated: Allowing multiple outcomes for one state-symbol pair creates branching.

• Birkhoff–Grothendieck theoremRelated: The projective line’s two-chart description reduces bundles to algebraic transition data.

• Model of computationRelated: It specifies the legal computational step in many machine models.

• Road coloring theoremRelated: Each edge color acts as an input symbol selecting a transition from its source.