Deterministic or random cellular automata theory , is based on the definition of a finite set (called a network) of n dynamic systems (called automata) Ai, i varying from 1 to n, whose state xi(t) (i = 1,..., n) at the tith iteration depends on the state of the automata at iteration (t - 1), through a transition function F :
You do not have access to this resource.
Exclusive to subscribers. 97% yet to be discovered!
(1) - MARCELPOIL (R.), USSON (Y.) - Methods for the study of cellular sociology : Voronoï diagrams and parametrization of the spatial relationships - J. Theor. Biol. 154, 359-369 (1992).
This offer includes interactive articles. Their quizzes highlight the key information to remember and validate their acquisition: from reader to player, you can enrich your knowledge.
You can easily identify them thanks to this pictogram: