Orbits of the Bernoulli measure in single-transition asynchronous cellular automata

We study iterations of the Bernoulli measure under nearest-neighbour asynchronous binary cellular automata (CA) with a single transition. For these CA, we show that a coarse-level description of the orbit of the Bernoulli measure can be obtained, that is, one can explicitly compute measures of short...

Бүрэн тодорхойлолт

Номзүйн дэлгэрэнгүй

Үндсэн зохиолчид:	Henryk Fukś, Andrew Skelton
Формат:	Artigo
Хэл сонгох:	Inglês
Хэвлэсэн:	Discrete Mathematics & Theoretical Computer Science 2011-01-01
Цуврал:	Discrete Mathematics & Theoretical Computer Science
Нөхцлүүд:	cellular automata. asynchronous rules measure dynamics [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] [math.math-ds] mathematics [math]/dynamical systems [math.ds] [nlin.nlin-cg] nonlinear sciences [physics]/cellular automata and lattice gases [nlin.cg] [math.math-co] mathematics [math]/combinatorics [math.co]
Онлайн хандалт:	https://dmtcs.episciences.org/2972/pdf
Шошгууд:	Шошго нэмэх Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!