Description: Cellular automata (CA) is a method for simulating local rules and local relations. A typical cellular automaton is defined on a grid, where the mesh on each point represents a cell and a finite state. The change rules apply to each cell and simultaneously. A typical change rule is determined by the state of the cell and the state of its (4 or 8) neighbors. Cellular automata have been applied to many fields such as physical simulation and biological simulation. This article deals with some interesting rules that consider how to write effective MATLAB programs to implement these cellular automata.
To Search:
File list (Check if you may need any files):
元胞自动机与Matlab.pdf
Download