Skip to content
#

Cellular automaton

A cellular automaton is a discrete model of computation studied in automata theory.

It consists of a regular grid of cells, each in one of a finite number of states; a new generation is created according to some fixed rule that determines the new state of each cell in terms of the current state of the cell and its neighborhood.

Typically, the rule for updating the state of cells is the same for each cell and does not change over time, and is applied to the whole grid simultaneously, though exceptions are known, such as the stochastic cellular automaton and asynchronous cellular automaton.

A well-known cellular automaton is Conway’s Game of Life.

Here are 20 public repositories matching this topic...

Cellular Automaton projects for Multiscale Modeling classes. So far, it includes Elementary CA (1D), Game of Life (2D) and Grain Growth CA (2D).

  • Updated Jun 11, 2019
  • C#

This C# Windows Application project allows users to visualize and simulate the evolution of Conway's Game of Life, with basic features like cell toggling and advanced features like custom game colors and boundary behavior.

  • Updated May 3, 2023
  • C#

Created by Stanisław Ulam, John von Neumann

Released 1940

Followers
4 followers
Wikipedia
Wikipedia

Related Topics

automaton conways-game-of-life