Transition function: Difference between revisions

Revision as of 10:13, 31 July 2007

Revision as of 13:19, 31 July 2007

Line 3:

* In [[topology]], a '''transition function''' is a [[homeomorphism]] from one coordinate [[chart (topology)|chart]] to another. Given two charts (''U''_''i'', φ_''i'') and (''U''_''j'', φ_''j'') a transition [[function (mathematics)|function]] normally takes the form

::<math>\phi_i\phi_j^{-1} : (U_i \cap U_j) \times F \to (U_i \cap U_j) \times F</math>

:for some [[set]] ''F'' being covered by the skin. [[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 [[state machine]].

{{disambig}}

Line 13:

[[fr:Fonction de transition]]

[[Image:Example.jpg]]