FUNDAMENTALNAYA I PRIKLADNAYA MATEMATIKA

(FUNDAMENTAL AND APPLIED MATHEMATICS)

2002, VOLUME 8, NUMBER 2, PAGES 621-626

Probabylistic classification methods of cellular automata

A. V. Lebedev

Abstract

View as HTML     View as gif image    View as LaTeX source

A class of cellular automata (games) on the infinite plane lattice of square cells with two states (0 and 1) is considered. Under random initial conditions (independent states with given expectation) the expectations of a cell state on the first step are calculated. The classification of games is based on their "favour" for growth of the number of cells in the state 1. A quantitative measure of this "favour" is suggested and studied as a random value on the games' space. Some possible generalizations are discussed.

All articles are published in Russian.

Location: http://mech.math.msu.su/~fpm/eng/k02/k022/k02216h.htm
Last modified: November 26, 2002