Transition function: Difference between revisions

Content deleted Content added
Linas (talk | contribs)
m typo
m fmt
Line 3:
* In [[topology]], a ''transition function'' is a homeomorphism from one coordinate [[chart (topology)|chart]] to another. Given two charts (''U''<sub>''i''</sub>, &phi;<sub>''i''</sub>) and (''U''<sub>''j''</sub>, &phi;<sub>''j''</sub>) a transition 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 topology. See [[fiber bundle]] for additonaladditional details.
 
* In [[computing]], a ''transition function'' is the function that defines the state transitions of a [[Turing machine]] or a [[state machine]].