Elementary Cellular Automata
- Cellular Automata
- This model provides an interactive implementation of Wolfram's Elementary CAs, which are CAs in a one-dimensional space with two-state cells in three-neighborhoods. Infinite as well as finite spaces are supported, and the 'bits' of the CA rule and system state can be edited directly.
The model writeup, including exercises, is part of the CA series writeup file.
- NetLogo source file
← Back to Virtual Laboratory