cellular automaton
Sign in to saveAlso known as cellular space, tessellation automaton, homogeneous structure, cellular structure, tessellation structure, iterative array, cellular automata
discrete model studied in computability theory, mathematics, physics, complexity science, theoretical biology and microstructure modeling
Research
2,340 papers- Cellular-automaton model for tumor growth dynamics: Virtualization of different scenarios.Computers in biology and medicine · 2023
- Minimal cellular automaton model with heterogeneous cell sizes predicts epithelial colony growth.Journal of theoretical biology · 2024
- Cellular-Automaton Decoders with Provable Thresholds for Topological Codes.Physical review letters · 2019
- Cellular Automaton Mimicking Colliding Bodies for Topology Optimization.Materials (Basel, Switzerland) · 2022
- Stochastic cellular automaton model of culture formation.Physical review. E · 2023
via PubMed
Wikidata facts
- Subclass of
- finite-state machine
- Image
- CA rule110 x400 y200 single.png
Show 6 more facts
- Commons category
- Cellular automata
- Stack Exchange tag
- physics.stackexchange.com/tags/cellular-automaton
- topic's main category
- Category:Cellular automata
- studied by
- automata theory
- short name
- КА
- maintained by WikiProject
- WikiProject Mathematics
via Wikidata · CC0
~37 min read
Encyclopedic overview
Gosper's Glider Gun creating "gliders" in the cellular automaton Conway's Game of Life
A cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model of computation studied in automata theory. Cellular automata are also called cellular spaces, tessellation automata, homogeneous structures, cellular structures, tessellation structures, and iterative arrays. Cellular automata have found application in various areas, including physics, theoretical biology, and microstructure modeling.
Excerpted from Wikipedia’s “cellular automaton” article, available under the CC BY-SA 4.0 licence.