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.

元胞自动机与Matlab.pdf

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．