ONE DIMENSIONAL nARY DENSITY CLASSIFICATION USING TWO CELLULAR AUTOMATON RULES
1999 ◽
Vol 10
(05)
◽
pp. 883-889
◽
Keyword(s):
Suppose each site on a one-dimensional chain with periodic boundary condition may take on any one of the states 0,1,…,n-1; can you find out the most frequently occurring state using cellular automaton? Here, we prove that while the above density classification task cannot be resolved by a single cellular automaton, this task can be performed efficiently by applying two cellular automaton rules in succession.
2016 ◽
Vol 43
(4)
◽
pp. 350-367
◽
2009 ◽
Vol 223
(8)
◽
pp. 1889-1901
◽
2014 ◽
Vol 23
(5)
◽
pp. 884-900
◽
2014 ◽
Vol 228
(7)
◽
pp. 643-651
◽
2010 ◽
Vol 28
(4)
◽
pp. 1635-1654
◽
Keyword(s):
Keyword(s):