Restricted Density Classification in One Dimension

Abstract : The density classification task is to determine which of the symbols appearing in an array has the majority. A cellular automaton solving this task is required to converge to a uniform configuration with the majority symbol at each site. It is not known whether a one-dimensional cellular automaton with binary alphabet can classify all Bernoulli random configurations almost surely according to their densities. We show that any cellular automaton that washes out finite islands in linear time classifies all Bernoulli random configurations with parameters close to 0 or 1 almost surely correctly. The proof is a direct application of a “percolation” argument which goes back to Gács (1986).
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01442476
Contributor : Hal Ifip <>
Submitted on : Friday, January 20, 2017 - 4:09:26 PM
Last modification on : Monday, January 23, 2017 - 2:02:49 PM
Long-term archiving on : Friday, April 21, 2017 - 3:44:34 PM

File

338243_1_En_18_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Siamak Taati. Restricted Density Classification in One Dimension. 21st Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2015, Turku, Finland. pp.238-250, ⟨10.1007/978-3-662-47221-7_18⟩. ⟨hal-01442476⟩

Share

Metrics

Record views

192

Files downloads

169