Transition function: Difference between revisions

Revision as of 13:12, 7 March 2011

Revision as of 20:37, 17 March 2011

Line 5:

:for some [[Set (mathematics)|set]] ''F'' being covered by the [[topology]]. See [[fiber bundle]] and [[atlas (topology)]] for additional details.

* In [[computing]], a '''transition function''' is the function that defines the state transitions of a [[Turing machine]] or a, [[finite-state machine]], or [[cellular automaton]].

{{mathdab}}[[Category:Homeomorphisms]]