Skip to content
#

Cellular automaton

Star

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 44 public repositories matching this topic...

Language: C
Filter by language
All 529 Python 116 C++ 68 JavaScript 57 C 44 Java 43 Rust 27 TypeScript 25 C# 21 Go 13 Kotlin 11
Sort: Most stars
Sort options
Most stars Fewest stars Most forks Fewest forks Recently updated Least recently updated

Created by Stanisław Ulam, John von Neumann

Released 1940

Followers
6 followers
Website
github.com/topics/cellular-automaton
Wikipedia
Wikipedia

Related topics

automaton conways-game-of-life