.png){kind=icon}
Return
A Sequential Solution to the Density Classification Task Using an Intermediate Alphabet
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-032-01570-9_8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present a sequential cellular automaton of radius 1/2 as a solution to the density classification task that makes use of an intermediate alphabet, and converges to a clean fixed point with no remaining auxiliary or intermediate information. We extend this solution to arbitrary finite alphabets and to configurations in higher dimensions.
Keywords:
Cellular automata
Density classification task
Sequential update
Journal
C
IF:
0
Papers:
15
Citations:
0
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
View more