Loading Icon

Cellular automaton

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.

Metrics Summary

Total Publications
Lifetime
14,091
Prior Five Years
3,254
Total Citations
Lifetime
201,390
Prior Five Years
19,789
Total Scholars
Lifetime
13,630
Prior Five Years
10,684

Publications and Citation History

Publications based on Disciplines

Scholars based on Disciplines

Publications based on Fields

Scholars based on Fields

Highly Ranked Scholars™

Lifetime
Prior Five Years

Highly Cited Publications

Lifetime