next up previous contents
Next: 3. Languages for Cellular Up: 2. Choices in the Previous: 2.7 Reversible CA   Contents

2.8 Summary of construction choices

In this chapter we have discussed the different choices one has to make in the construction of cellular automata and presented some techniques to help in the construction. The particular choices and most common selections are:

We have demonstrated the choices using the simple example of the Greenberg-Hastings cellular automaton, which we have extended in many different directions.

Jörg R. Weimar