Skip to Main content Skip to Navigation
Conference papers

Stochastic Cellular Automata Solve the Density Classification Problem with an Arbitrary Precision

Nazim A. Fatès 1 
1 MAIA - Autonomous intelligent machine
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : The density classification problem consists in using a binary cellular automaton (CA) to decide whether an initial configuration contains more 0s or 1s. This problem is known for having no exact solution in the case of binary, deterministic, one-dimensional CA. Stochastic cellular automata have been studied as an alternative for solving the problem. This paper is aimed at presenting techniques to analyse the behaviour of stochastic CA rules, seen as a "blend'' of deterministic CA rules. Using analytical calculations and numerical simulations, we analyse two previously studied rules and present a new rule. We estimate their quality of classification and their average time of classification. We show that the new rule solves the problem with an arbitrary precision. From a practical point of view, this rule is effective and exhibits a high quality of classification, even when the simulation time is kept small.
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Nazim Fatès Connect in order to contact the contributor
Submitted on : Friday, January 7, 2011 - 2:46:00 PM
Last modification on : Wednesday, February 2, 2022 - 3:51:16 PM
Long-term archiving on: : Friday, December 2, 2016 - 5:51:32 PM


Files produced by the author(s)



Nazim A. Fatès. Stochastic Cellular Automata Solve the Density Classification Problem with an Arbitrary Precision. Symposium on Theoretical Aspects of Computer Science - STACS2011, Mar 2011, Dortmund, Germany. pp.284--295, ⟨10.4230/LIPIcs.STACS.2011.284⟩. ⟨inria-00521415v3⟩



Record views


Files downloads