transitions denote relations of type X->X. Crossing a transition is equivalent to applying the relation that labels it (computing a set of changes to the data type X), and traversing a path in the machine corresponds to applying all the associated relations, one after the other.

Original theory

Eilenberg's original X-machine was a completely general theoretical model of computation (subsuming the Turing machine,

1.Previous
3.Next