Cellular automata: Basic definitions

Karl Peter Hadeler, Johannes Müller

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

7 Scopus citations

Abstract

What is a cellular automaton? This question is not too easy to answer. In the present approach, we define cellular automata in a very narrow sense: the automaton is deterministic and it has a high degree of symmetry. This narrow definition allows us to develop a relatively rich theory. In applications, however, these assumptions are quite often relaxed. Many mathematical systems describe the behavior of single particles, molecules or cells. Such small entities, described on a small spatial scale, do not follow strict deterministic laws but are subject to stochastic variation. Hence it is quite natural to generalize the concept of a cellular automaton in such a way that the local rule depends on random variables.

Original languageEnglish
Title of host publicationSpringer Monographs in Mathematics
PublisherSpringer Verlag
Pages19-35
Number of pages17
Edition9783319530420
DOIs
StatePublished - 2017
Externally publishedYes

Publication series

NameSpringer Monographs in Mathematics
Number9783319530420
ISSN (Print)1439-7382

Fingerprint

Dive into the research topics of 'Cellular automata: Basic definitions'. Together they form a unique fingerprint.

Cite this