Modified Traffic Cellular Automaton for the Density Classification Task - Archive ouverte HAL Access content directly
Journal Articles Fundamenta Informaticae Year : 2012

Modified Traffic Cellular Automaton for the Density Classification Task

Abstract

The density classification task asks to design a cellular automaton that converges to the uniform configuration that corresponds to the state that is in majority in the initial configuration. We investigate connections of this problem to state-conserving cellular automata. We propose a modified traffic CA that washes out finite islands in the same way as the Gacs, Kurdyumov and Levin automaton, but is also guaranteed to converge to a uniform configuration on rings of odd size. We find experimentally several good classifiers that are close to state-conserving cellular automata, and we observe that the best performing known density classifier by Wolz and de Oliveira is only a simple swap away from a state-conserving automaton.

Domains

Other [cs.OH]
No file

Dates and versions

hal-00823216 , version 1 (16-05-2013)

Identifiers

Cite

Jarkko Kari, Bastien Le Gloannec. Modified Traffic Cellular Automaton for the Density Classification Task. Fundamenta Informaticae, 2012, 116 (1-4), pp 141-156. ⟨10.3233/FI-2012-675⟩. ⟨hal-00823216⟩
95 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More