The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Theory of cellular automata: A survey
Open accessAbstract
This article surveys some theoretical aspects of cellular automata CA research. In particular, we discuss classical and new results on reversibility, conservation laws, limit sets, decidability questions, universality and topological dynamics of CA. The selection of topics is by no means comprehensive and reflects the research interests of the author. The main goal is to provide a tutorial of CA theory to researchers in other branches of natural computing, to give a compact collection of known results with references to their proofs, and to suggest some open problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Theory of Self-Reproducing Automata
Schwartz, J. T., von Neumann, J., & Burks, A. W. (1967) · Mathematics of Computation · doi:10.2307/2005041 · Cited by 5,422
Logical Reversibility of Computation
Bennett, C. H. (1973) · IBM Journal of Research and Development · doi:10.1147/rd.176.0525 · Cited by 3,679
Statistical mechanics of cellular automata
Wolfram, S. (1983) · Reviews of Modern Physics · doi:10.1103/revmodphys.55.601 · Cited by 3,114
Lattice-gas automata for the Navier-Stokes equation
Frisch, U., Hasslacher, B., & Pomeau, Y. (1986) · Physical Review Letters · doi:10.1103/physrevlett.56.1505 · Cited by 2,788
An Introduction to Chaotic Dynamical Systems
Devaney, R. L., & Eckmann, J.-P. (1987) · Physics Today · doi:10.1063/1.2820117 · Cited by 2,344
Universality and complexity in cellular automata
Wolfram, S. (1984) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(84)90245-8 · Cited by 1,914
Witten, T. A., & Sander, L. M. (1983) · Physical Review B · doi:10.1103/physrevb.27.5686 · Cited by 1,856
Theory and Applications of Cellular Automata
Wolfram, S. (1986) · Cited by 1,743
(1990) · Acta Applicandae Mathematicae · doi:10.1007/bf00049580 · Cited by 1,603
Cellular Automata Machines: A New Environment for Modeling
Toffoli, T., & Margolus, N. (1987) · The MIT Press eBooks · doi:10.7551/mitpress/1763.001.0001 · Cited by 1,425
Cited by
Tumor-Cut: Segmentation of Brain Tumors on Contrast Enhanced MR Images for Radiosurgery Applications
Hamamci, A., Kucuk, N., Karaman, K., Engin, K., & Unal, G. (2012) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2011.2181857 · Cited by 286
Enayatifar, R., Sadaei, H. J., Abdullah, A. H., Lee, M., & Isnin, I. F. (2015) · Optics and Lasers in Engineering · doi:10.1016/j.optlaseng.2015.03.007 · Cited by 144
Albantakis, L., & Tononi, G. (2015) · Entropy · doi:10.3390/e17085472 · Cited by 58
Dirac Cellular Automaton from Split-step Quantum Walk
Mallick, A., & Chandrashekar, C. M. (2016) · Scientific Reports · doi:10.1038/srep25779 · Cited by 45
“The state update rule acts synchronously at every position called the lattice point where the unit cells of the lattice are all identical with the underlying graph being regular [54].”
Background
Metadata
- Authors
- Kari, J.
- Venue
- Theoretical Computer Science
- Publisher
- Elsevier BV
- Published
- 2005-04
- Volume
- 334
- Issue
- 1-3
- Pages
- 3-33
- ISSN
- 0304-3975 (ISSN-L)
- OpenAlex
- W2022060148
- Cited by
- 625
- References
- 36
- FWCI
- 14.75
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Theory of cellular automata: A survey. https://app.cochat.ai/papers/10.1016/j.tcs.2004.11.021
- The paper
- Kari, J. (2005). Theory of cellular automata: A survey. Theoretical Computer Science. https://doi.org/10.1016/j.tcs.2004.11.021
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.