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 ap
Platform: |
Size: 231424 |
Author: c.ljx
|
Hits: