Theory of cellular automata: A survey
By Jarkko Kari. Theoretical Computer Science, 2005
670 citations recorded by the source corpus.
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.
Subfields: Computational Theory and Mathematics, Molecular Biology
View Paper: https://www.semanticscholar.org/paper/e69764d312adb05a2202ab187c983cd334dfd26e
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Michael Hochman
- Pablo Shmerkin
- P. P. Varj'u
- Boris Solomyak
- Tamás Keleti
- Ronnie Pavlov
- Michael Schraudner
- Meng Wu
In Molecular Biology
Citations in the corpus
- On the dynamics and recursive properties of multidimensional symbolic systems (2009, background): “have been studied by several authors [12, 6, 13, 17, 28], and as in the case of SFTs, most properties are undecidable. See [ 18 ] for a recent survey.”