Affine continuous cellular automata solving the fixed-length density classification problem
Marcin Dembowski , Barbara Wolnik , Witold Bołt , Jan M. Baetens , Bernard De Baets
AbstractIn this paper, the classical density classification problem is considered in the context of affine continuous cellular automata. It has been shown earlier that there exists no general solution to this problem that is valid for any number of cells. Here, we consider this problem in the case of a fixed number of cells. Necessary conditions for solving the problem are formulated. Based on this knowledge, a specific class of affine continuous cellular automata is evaluated experimentally for 23 cells. A rich solution set is analysed and visualised.
|Journal series||Natural Computing, ISSN 1567-7818|
|Publication size in sheets||0.5|
|Keywords in English||density classification problem, affine continuous cellular automata, majority problem|
|Score|| = 25.0, 20-12-2017, ArticleFromJournal|
= 25.0, 20-12-2017, ArticleFromJournal
|Publication indicators||: 2016 = 0.778 (2) - 2016=0.767 (5)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.