Difference between revisions of "Cellular automaton"
Jump to navigation
Jump to search
(New page: A '''cellular automaton''' is a 4-tuple <math> \{ Z, S, N, f\} </math>, where: * <math>Z</math> is a lattice. * <math>S</math> is a finite set of cell ''states'' or ''values''. * <math...) |
m |
||
| Line 3: | Line 3: | ||
* <math>S</math> is a finite set of cell ''states'' or ''values''. | * <math>S</math> is a finite set of cell ''states'' or ''values''. | ||
* <math>I</math> is the finite ''neighborhood''. | * <math>I</math> is the finite ''neighborhood''. | ||
| − | * <math>f</math> is the '' | + | * <math>f</math> is the ''transition function''. |
| − | The lattice is a grid filled with cells, each cell is uniquely identified by its coordinates and value. The cellular automaton evolves via the | + | The lattice is a grid filled with cells, each cell is uniquely identified by its coordinates and value. The cellular automaton evolves via the transition function with respect to the discrete time variable. |
[[category:mathematics]] | [[category:mathematics]] | ||
[[category:computer science]] | [[category:computer science]] | ||
Revision as of 09:24, April 20, 2007
A cellular automaton is a 4-tuple , where:
- is a lattice.
- is a finite set of cell states or values.
- is the finite neighborhood.
- is the transition function.
The lattice is a grid filled with cells, each cell is uniquely identified by its coordinates and value. The cellular automaton evolves via the transition function with respect to the discrete time variable.