Cellular automaton topic
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.
Go-L
Game of Life with different update rules and on a bunch of different topologies (sphere, torus, klein bottle, etc.)
cellular-automata-posters
Simple Python script that generates cellular automata posters as PDF files.
NDCell
A fast, flexible, and feature-rich interactive multidimensional cellular automaton simulator written in Rust
nutshell
[alpha!] [dormant!] An advanced cellular-automaton-specification language that transpiles to Golly's.
GameOfLife
Conway's Game of Life macOS app.
cellular-automata-explorer
(WIP) An interactive web app for exploring cellular automata.
VAE-NCA
This repo provides the code to replicate the experiments in the paper: Image Generation With Neural Cellular Automatas.
pyca
A more general Python Cellular Automata with multi-dimensions and multi-cell type mix
cabasa
A generic 2D cellular automaton simulator
jell-machine
A remake of the game "Cell Machine" written in JavaScript.