![]() For each cell, a set of cells called its neighborhood is defined relative to the specified cell. The grid can be in any finite number of dimensions. Cellular automata have found application in various areas, including physics, theoretical biology and microstructure modeling.Ī cellular automaton consists of a regular grid of cells, each in one of a finite number of states, such as on and off (in contrast to a coupled map lattice). Cellular automata are also called cellular spaces, tessellation automata, homogeneous structures, cellular structures, tessellation structures, and iterative arrays. ![]() CA) is a discrete model of computation studied in automata theory. Gosper's Glider Gun creating " gliders" in the cellular automaton Conway's Game of Life Ī cellular automaton (pl. Discrete model studied in computer science
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |