Stable states of probabilistic cellular automata

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

A study is made of the stability of steady states of probabilistic cellular automata defined on countable graphs. An important class of states are the quasi-deterministic states in which the "error sets" are confined to small isolated sets in the graph. In particular, quasi-deterministic states of majority vote systems defined on trees are discussed and criteria for their existence and stability are obtained. © 1977 Academic Press, Inc.

Cite

CITATION STYLE

APA

Dawson, D. A. (1977). Stable states of probabilistic cellular automata. Information and Control, 34(2), 93–106. https://doi.org/10.1016/S0019-9958(77)80006-5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free