All these automata have extremely simple rules of evaluation.
Although updates are made using clocked full-state update,
the model is compatible with asychnronous clockless autonomous state changes.
The most feasible for general computation. Reversible and information-conservative